思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
Visualization & Analysis
。关于这个话题，体育直播提供了深入分析
ОАЭ задумались об атаке на Иран20:55。safew官方下载对此有专业解读
The advertisement is everywhere. The ice hockey player Peter Forsberg is trying on a pair of black glasses. In the viral clip he talks to the glasses, asking who is Sweden’s greatest hockey player of all time.
would return the longest common *path*”