思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
Its workings were considered as part of the Covid inquiry, and will be addressed in a report due to be published on 16 April.
，详情可参考下载安装 谷歌浏览器 开启极速安全的 上网之旅。
Morgan Stanley predicts AI won’t let you retire early: Instead, you’ll have to train for jobs that don’t exist yet
今天凌晨，英伟达正式发布 2026 财年第四季度及全年财报：