思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
如果你的系统 Node.js 版本较低，推荐使用便携式二进制包：
，推荐阅读heLLoword翻译官方下载获取更多信息
This works, but it's slow.，这一点在51吃瓜中也有详细论述
Fast food workers in California are demanding employers sign a pledge reaffirming workers’ rights amid Immigration and Customs Enforcement (ICE) raids at workplaces across the US.
The problem gets worse in pipelines. When you chain multiple transforms – say, parse, transform, then serialize – each TransformStream has its own internal readable and writable buffers. If implementers follow the spec strictly, data cascades through these buffers in a push-oriented fashion: the source pushes to transform A, which pushes to transform B, which pushes to transform C, each accumulating data in intermediate buffers before the final consumer has even started pulling. With three transforms, you can have six internal buffers filling up simultaneously.