思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
The performance impact on typical applications will be much smaller, since they don’t usually present walls of icons in their UI.
，详情可参考雷电模拟器官方版本下载
provision.devtools
He said: "Wear a leek, eat a leek. Wear a daffodil. Eat a Welsh cake. Share a cwtch (a cuddle). Dydd Gŵyl Dewi Hapus iawn, have a very happy St David's Day."
Nature, Published online: 24 February 2026; doi:10.1038/d41586-026-00591-z