"We're going to fly when we're ready... crew safety is going to be our number one priority."
思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
。Line官方版本下载对此有专业解读
Will tech trump tradition at bakers and biscuit makers?。业内人士推荐WPS下载最新地址作为进阶阅读
4+and [Colororado][col]:
const addChunk = (chunk) = {