while (stack.length && stack.at(-1) <= cur) {
思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
，更多细节参见旺商聊官方下载
Consider Nava. Another of her favorite phrases is “I seein’ it!”
"name": "Enhance",
Last of the summer rain puts southern states on flood watch and Sydney on alert for bull sharks
· 刘洋 · 来源：dev资讯