File tree Expand file tree Collapse file tree 3 files changed +37
-0
lines changed
solution/1200-1299/1266.Minimum Time Visiting All Points Expand file tree Collapse file tree 3 files changed +37
-0
lines changed Original file line number Diff line number Diff line change @@ -95,6 +95,20 @@ class Solution {
95
95
}
96
96
```
97
97
98
+ ### ** TypeScript**
99
+
100
+ ``` ts
101
+ function minTimeToVisitAllPoints(points : number [][]): number {
102
+ let ans = 0 ;
103
+ for (let i = 1 ; i < points .length ; i ++ ) {
104
+ let dx = Math .abs (points [i ][0 ] - points [i - 1 ][0 ]),
105
+ dy = Math .abs (points [i ][1 ] - points [i - 1 ][1 ]);
106
+ ans += Math .max (dx , dy );
107
+ }
108
+ return ans ;
109
+ }
110
+ ```
111
+
98
112
### ** C++**
99
113
100
114
``` cpp
Original file line number Diff line number Diff line change @@ -81,6 +81,20 @@ class Solution {
81
81
}
82
82
```
83
83
84
+ ### ** TypeScript**
85
+
86
+ ``` ts
87
+ function minTimeToVisitAllPoints(points : number [][]): number {
88
+ let ans = 0 ;
89
+ for (let i = 1 ; i < points .length ; i ++ ) {
90
+ let dx = Math .abs (points [i ][0 ] - points [i - 1 ][0 ]),
91
+ dy = Math .abs (points [i ][1 ] - points [i - 1 ][1 ]);
92
+ ans += Math .max (dx , dy );
93
+ }
94
+ return ans ;
95
+ }
96
+ ```
97
+
84
98
### ** C++**
85
99
86
100
``` cpp
Original file line number Diff line number Diff line change
1
+ function minTimeToVisitAllPoints ( points : number [ ] [ ] ) : number {
2
+ let ans = 0 ;
3
+ for ( let i = 1 ; i < points . length ; i ++ ) {
4
+ let dx = Math . abs ( points [ i ] [ 0 ] - points [ i - 1 ] [ 0 ] ) ,
5
+ dy = Math . abs ( points [ i ] [ 1 ] - points [ i - 1 ] [ 1 ] ) ;
6
+ ans += Math . max ( dx , dy ) ;
7
+ }
8
+ return ans ;
9
+ }
You can’t perform that action at this time.
0 commit comments