几何|贪心

lc1266

计算所有相邻点在横纵坐标上的位移绝对值的最大值

累加得到按斜向移动规则遍历所有点的最短时间

class Solution {
public:
int minTimeToVisitAllPoints(vector<vector<int>>& points)
{
int ret=0;
for(int i=0;i<points.size()-1;i++)
{
ret+=max
(abs(points[i][0]-points[i+1][0]),
abs(points[i][1]-points[i+1][1]));
}
return ret;
}
};