思路：① 算每辆车到达时间 = (target - position) / speed；② 按位置降序排序；③ 单调递增栈：仅当当前时间 栈顶时间时压栈（新车队），否则合并。栈长即为车队数。可优化为用变量代替栈。
Complete digital access to quality FT journalism with expert analysis from industry leaders. Pay a year upfront and save 20%.
，这一点在heLLoword翻译官方下载中也有详细论述
Perfect For: Small businesses, social media managers, and anyone needing quick, professional-looking designs.
int count[10] = {0}; // 0-9共10个桶