"I believe we've had a problem here," said Swigert. Lovell had to repeat the message to a stunned Mission Control: "Houston, we've had a problem."
Here’s how it works:，更多细节参见谷歌浏览器【最新下载地址】
思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。，这一点在搜狗输入法下载中也有详细论述
window.DECRYPTED_AUDIO_CHUNKS.push(data);