leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1266.cpp (312B)

0 class Solution { 1 public: 2 int minTimeToVisitAllPoints(const vector<vector<int>> &points) const { 3 int res = 0; 4 for (int i = 1; i < points.size(); i++) { 5 res += max(abs(points[i][0] - points[i - 1][0]), abs(points[i][1] - points[i - 1][1])); 6 } 7 return res; 8 } 9 };