File tree Expand file tree Collapse file tree 3 files changed +64
-0
lines changed
solution/1600-1699/1653.Minimum Deletions to Make String Balanced Expand file tree Collapse file tree 3 files changed +64
-0
lines changed Original file line number Diff line number Diff line change @@ -187,6 +187,29 @@ function minimumDeletions(s: string): number {
187
187
}
188
188
```
189
189
190
+ #### JavaScript
191
+
192
+ ``` js
193
+ /**
194
+ * @param {string} s
195
+ * @return {number}
196
+ */
197
+ var minimumDeletions = function (s ) {
198
+ const n = s .length ;
199
+ const f = new Array (n + 1 ).fill (0 );
200
+ let b = 0 ;
201
+ for (let i = 1 ; i <= n; ++ i) {
202
+ if (s[i - 1 ] === ' b' ) {
203
+ f[i] = f[i - 1 ];
204
+ ++ b;
205
+ } else {
206
+ f[i] = Math .min (f[i - 1 ] + 1 , b);
207
+ }
208
+ }
209
+ return f[n];
210
+ };
211
+ ```
212
+
190
213
<!-- tabs: end -->
191
214
192
215
<!-- solution: end -->
Original file line number Diff line number Diff line change @@ -185,6 +185,29 @@ function minimumDeletions(s: string): number {
185
185
}
186
186
```
187
187
188
+ #### JavaScript
189
+
190
+ ``` js
191
+ /**
192
+ * @param {string} s
193
+ * @return {number}
194
+ */
195
+ var minimumDeletions = function (s ) {
196
+ const n = s .length ;
197
+ const f = new Array (n + 1 ).fill (0 );
198
+ let b = 0 ;
199
+ for (let i = 1 ; i <= n; ++ i) {
200
+ if (s[i - 1 ] === ' b' ) {
201
+ f[i] = f[i - 1 ];
202
+ ++ b;
203
+ } else {
204
+ f[i] = Math .min (f[i - 1 ] + 1 , b);
205
+ }
206
+ }
207
+ return f[n];
208
+ };
209
+ ```
210
+
188
211
<!-- tabs: end -->
189
212
190
213
<!-- solution: end -->
Original file line number Diff line number Diff line change
1
+ /**
2
+ * @param {string } s
3
+ * @return {number }
4
+ */
5
+ var minimumDeletions = function ( s ) {
6
+ const n = s . length ;
7
+ const f = new Array ( n + 1 ) . fill ( 0 ) ;
8
+ let b = 0 ;
9
+ for ( let i = 1 ; i <= n ; ++ i ) {
10
+ if ( s [ i - 1 ] === 'b' ) {
11
+ f [ i ] = f [ i - 1 ] ;
12
+ ++ b ;
13
+ } else {
14
+ f [ i ] = Math . min ( f [ i - 1 ] + 1 , b ) ;
15
+ }
16
+ }
17
+ return f [ n ] ;
18
+ } ;
You can’t perform that action at this time.
0 commit comments