Read full article
思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
，推荐阅读搜狗输入法2026获取更多信息
Раскрыты подробности о договорных матчах в российском футболе18:01
SAVE $600: As of Feb. 27, the Ecovacs Deebot X9 Pro Omni is on sale for $699 at Amazon. That's a 46% discount on the list price.