1266. Minimum Time Visiting All Points

//https://leetcode.com/problems/minimum-time-visiting-all-points/
class Solution {
public:
    int minTimeToVisitAllPoints(vector<vector<int>>& points) {
        int steps(0);
        for (int i = 1; i < points.size(); ++i) {
            int dx=abs(points[i][0] - points[i-1][0]), dy=abs(points[i][1] - points[i-1][1]);
            steps += min(dx, dy) + abs(dx - dy);
        }
        return steps;
    }
};