Why you can't get a signal at festivals and sports matches
Continue reading...
。关于这个话题，旺商聊官方下载提供了深入分析
代码要点：倒序遍历，先算右侧再推左侧；栈内维护「右侧候选更大值」，单调递增（栈顶最小）。
tee() splits a stream into two branches. It seems straightforward, but the implementation requires buffering: if one branch is read faster than the other, the data must be held somewhere until the slower branch catches up.