Why the FT?See why over a million readers pay to read the Financial Times.
思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。，推荐阅读一键获取谷歌浏览器下载获取更多信息
Manjit Sangha, who worked seven days a week before her illness, returned home on a Sunday afternoon in July last year, feeling unwell.，详情可参考旺商聊官方下载
可以看到警方从多个方向接近枪手原先的射击位置。