Time: 4 ms (13.24%), Space: 44.1 MB (10.67%) - LeetHub

Author: rahul003t

1266-minimum-time-visiting-all-points/1266-minimum-time-visiting-all-points.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int minTimeToVisitAllPoints(int[][] points) {
+        
+        int n= points.length;
+        int ans =0;
+        
+        for(int i=0; i<n-1; i++)
+        {
+            int deltaX = Math.abs(points[i+1][0] - points[i][0]);
+            int deltaY = Math.abs(points[i+1][1] - points[i][1]);
+            
+            ans += Math.min(deltaX,deltaY) + Math.abs(deltaX-deltaY);
+        }
+        
+        return ans;
+        
+    }
+}