while (stack.length && stack[stack.length - 1] cur) {
文 | 锌刻度，作者 | 李觐麟，编辑 | 黎文婕
。关于这个话题，WPS官方版本下载提供了深入分析
In the new report Breaking Free: Pathways to a fair technological future, the Norwegian Consumer Council has delved into enshittification and how to resist it. The report shows how this phenomenon affects both consumers and society at large, but that it is possible to turn the tide. Together with more than 70 consumer groups and other actors in Europe and the US, we are sending letter to policymakers in the EU/EEA, UK and the US.
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。