File tree 3 files changed +46
-0
lines changed
solution/0900-0999/0983.Minimum Cost For Tickets
3 files changed +46
-0
lines changed Original file line number Diff line number Diff line change 79
79
80
80
```
81
81
82
+ ### ** TypeScript**
83
+
84
+ ``` ts
85
+ function mincostTickets(days : number [], costs : number []): number {
86
+ const n = days .length , m = days [n - 1 ] + 1 ;
87
+ const [a, b, c] = costs ;
88
+ let dp = new Array (m ).fill (0 );
89
+ for (let i = 1 ; i < m ; i ++ ) {
90
+ let x = days .includes (i ) ? (dp [i - 1 ] + a ) : dp [i - 1 ];
91
+ let y = (i > 7 ? dp [i - 7 ] : dp [0 ]) + b ;
92
+ let z = (i > 30 ? dp [i - 30 ] : dp [0 ]) + c ;
93
+ dp [i ] = Math .min (x , y , z );
94
+ }
95
+ return dp [m - 1 ];
96
+ };
97
+ ```
98
+
82
99
### ** ...**
83
100
84
101
```
Original file line number Diff line number Diff line change @@ -94,6 +94,23 @@ In total you spent $17 and covered all the days of your travel.
94
94
95
95
```
96
96
97
+ ### ** TypeScript**
98
+
99
+ ``` ts
100
+ function mincostTickets(days : number [], costs : number []): number {
101
+ const n = days .length , m = days [n - 1 ] + 1 ;
102
+ const [a, b, c] = costs ;
103
+ let dp = new Array (m ).fill (0 );
104
+ for (let i = 1 ; i < m ; i ++ ) {
105
+ let x = days .includes (i ) ? (dp [i - 1 ] + a ) : dp [i - 1 ];
106
+ let y = (i > 7 ? dp [i - 7 ] : dp [0 ]) + b ;
107
+ let z = (i > 30 ? dp [i - 30 ] : dp [0 ]) + c ;
108
+ dp [i ] = Math .min (x , y , z );
109
+ }
110
+ return dp [m - 1 ];
111
+ };
112
+ ```
113
+
97
114
### ** ...**
98
115
99
116
```
Original file line number Diff line number Diff line change
1
+ function mincostTickets ( days : number [ ] , costs : number [ ] ) : number {
2
+ const n = days . length , m = days [ n - 1 ] + 1 ;
3
+ const [ a , b , c ] = costs ;
4
+ let dp = new Array ( m ) . fill ( 0 ) ;
5
+ for ( let i = 1 ; i < m ; i ++ ) {
6
+ let x = days . includes ( i ) ? ( dp [ i - 1 ] + a ) : dp [ i - 1 ] ;
7
+ let y = ( i > 7 ? dp [ i - 7 ] : dp [ 0 ] ) + b ;
8
+ let z = ( i > 30 ? dp [ i - 30 ] : dp [ 0 ] ) + c ;
9
+ dp [ i ] = Math . min ( x , y , z ) ;
10
+ }
11
+ return dp [ m - 1 ] ;
12
+ } ;
You can’t perform that action at this time.
0 commit comments