1266. Minimum Time Visiting All Points.cpp

// 1266.✅ Minimum Time Visiting All Points

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

        return ans;
    }
};