思路：单调递增栈 + k 控制删除次数。高位越小整体越小，遇更小数字时弹出栈顶大数（仅当 k0）；栈空且当前为 0 则跳过（避免前导零）；若遍历完 k 仍0，从末尾再删 k 位。
After Netflix's initial offer, Paramount Skydance swooped in with a hostile takeover attempt of the entire Warner Bros. Discovery business. WBD rejected it, Paramount tried again. Several additional volleys between the involved parties occurred over the past few weeks. While WBD has not yet formally accepted Paramount's offer — which will be subject to long-winded regulatory approvals sure to spark more drama — it seems the dust will soon settle for this chapter.
OPPO Find N6 真机曝光：肉眼几乎看不到折痕。业内人士推荐下载安装 谷歌浏览器 开启极速安全的 上网之旅。作为进阶阅读
* 核心思路：链表转数组 + 单调栈（从后往前遍历），时间复杂度O(n)，空间复杂度O(n)。服务器推荐对此有专业解读
if (bucketSize == 0) continue;
Мир Российская Премьер-лига|19-й тур。一键获取谷歌浏览器下载对此有专业解读