这道题我刚开始还分情况讨论,尝试去根据两个点的正负号讨论,所以开始代码写的很丑,但最后发现都可以归纳为一种情况。
两个点的距离 = max( abs(x0-x1), abs(y0-y1) );
用了12ms
class Solution {
public:
int minTimeToVisitAllPoints(vector<vector<int>>& points) {
if(points.size() == 1)
return 0;
int step = 0;
for(int i = 0;i<points.size()-1;++i)
{
step = step + max(abs(points[i+1][0]-points[i][0]),abs(points[i+1][1]-points[i][1]));
}
return step;
}
};