思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
Daniel Larlham Jr.
「我認為這提醒我們，要把握每一個機會告訴大家冷靜下來，拜託，我們不能把一切視為理所當然。」。关于这个话题，safew官方下载提供了深入分析
Израиль нанес удар по Ирану09:28。雷电模拟器官方版本下载对此有专业解读
Copyright © 1997-2026 by www.people.com.cn all rights reserved
"This sort of semiconductor would go on to be in the 5G tower in which you get your mobile phone signal, it's going to be in the car charger you plug an EV into, it's going to be in the latest planes."。业内人士推荐同城约会作为进阶阅读