Minimum Time Visiting All Points — C++

// Time:  O(n)
// Space: O(1)

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