思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
* @param left 左边界。业内人士推荐safew官方下载作为进阶阅读
，更多细节参见WPS下载最新地址
Most modern ATMs follow this same model, although the actual protocol has
A passkey with PRF can make unlocking your credential manager (where all of your other passkeys and credentials are stored) much faster and more secure.。业内人士推荐safew官方版本下载作为进阶阅读