如对本稿件有异议或投诉，请联系 [email protected]。
思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
，更多细节参见快连下载安装
I ripped out almost all of my lipgloss calls and replaced them with hand-rolled functions for concatting and measuring strings. These functions weren’t nearly as general, but that’s fine - they worked for my use case.，详情可参考Line官方版本下载
Юлия Мискевич (Ночной линейный редактор)