I tried to solve it somewhat elegantly:
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
。雷电模拟器官方版本下载对此有专业解读
场景：这就好比是一个空荡荡的剧院舞台。我们把它涂成了深灰色 (0x222222)，方便看清演员。
It's relatively unchartered territory for the series, allowing production designer Alison Gartshore, costume designer John Glaser, and hair and makeup designer Nic Collins to consider what Bridgerton looks like if Wednesday Addams landed in the Ton. But it also allows for quietly moving performances from two characters we'll see much more of in the future.