思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
Watch the NBA from anywhere in the world on Prime Video，更多细节参见91视频
黄仁勋：今年游戏显卡或会迎来供应紧张。im钱包官方下载对此有专业解读
Transplant surgeon and joint team leader Isabel Quiroga said she was "delighted" by Hugo's birth and called it a breakthrough for organ transplantation in the UK.，详情可参考搜狗输入法下载