暴力做法是对每个位置向右扫描找第一个更大值，O(n²)。可抽象为：元素像一排人，身高为数值。当前人「下一个更大」= 他右侧第一个没被挡住的人（比当前矮的都被挡住）。单调栈用 O(n) 维护「右侧候选更大值」：倒序遍历，弹掉 ≤ 当前的，栈顶即答案，再入栈当前值。
Google 的 AppFunctions 也是同理。
，详情可参考Line官方版本下载
Bafta said it wanted to "acknowledge the harm this has caused, address what happened and apologise to all", adding that it wanted to "assure all our members that a comprehensive review is under way".
Jack Dorsey just halved the size of Block’s employee base — and he says your company is next