1266. Minimum Time Visiting All Points.cpp

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