思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
This is fundamentally different from Web streams' pipeThrough(), which starts actively pumping data from the source to the transform as soon as you set up the pipe. Pull semantics mean you control when processing happens, and stopping iteration stops processing.，更多细节参见51吃瓜
。业内人士推荐夫子作为进阶阅读
Овечкин продлил безголевую серию в составе Вашингтона09:40
Последние новости，详情可参考搜狗输入法2026