27] Leetcode 1266. Minimum Time Visiting All Points

https://leetcode.com/problems/minimum-time-visiting-all-points/

Minimum Time Visiting All Points - LeetCode

가로로 세로로, 대각선으로 한 칸씩 갈 수 있기 때문에

 가로, 세로의 차 중에 큰 값으로 더 해주면 된다.

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

http://www.cplusplus.com/reference/cstdlib/abs/

abs - C++ Reference