File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 1+ function solution ( number , k ) {
2+ let stack = [ ] ;
3+ let 제거할수 = k ;
4+
5+ for ( let i = 0 ; i < number . length ; i ++ ) {
6+ while (
7+ 제거할수 > 0 &&
8+ stack . length > 0 &&
9+ stack [ stack . length - 1 ] < number [ i ]
10+ ) {
11+ stack . pop ( ) ;
12+ 제거할수 -- ;
13+ }
14+ stack . push ( number [ i ] ) ;
15+ }
16+
17+ while ( 제거할수 > 0 ) {
18+ stack . pop ( ) ;
19+ 제거할수 -- ;
20+ }
21+
22+ return stack . join ( '' ) ;
23+ }
24+
25+ // console.log(solution('1924', 2));
26+ // console.log(solution('1231234', 3));
27+ // console.log(solution('4177252841', 4));
28+ // console.log(solution('10', 1)); // 1
29+ // console.log(solution('9876543214', 4)); // 987654
30+ console . log ( solution ( '333222111' , 4 ) ) ; // 33322
Original file line number Diff line number Diff line change 1+ const alphabetValues = {
2+ B : 1 ,
3+ C : 2 ,
4+ D : 3 ,
5+ E : 4 ,
6+ F : 5 ,
7+ G : 6 ,
8+ H : 7 ,
9+ I : 8 ,
10+ J : 9 ,
11+ K : 10 ,
12+ L : 11 ,
13+ M : 13 ,
14+ N : 12 ,
15+ O : 12 ,
16+ P : 11 ,
17+ Q : 10 ,
18+ R : 9 ,
19+ S : 8 ,
20+ T : 7 ,
21+ U : 6 ,
22+ V : 5 ,
23+ W : 4 ,
24+ X : 3 ,
25+ Y : 2 ,
26+ Z : 1 ,
27+ } ;
28+
29+ function solution ( name ) {
30+ let answer = 0 ;
31+ for ( let i = 0 ; i < name . length ; i ++ ) {
32+ if ( name [ i ] === 'A' ) {
33+ answer += - 1 ;
34+ } else {
35+ answer += alphabetValues [ name [ i ] ] ;
36+ }
37+ }
38+ answer += name . length ;
39+ return answer ;
40+ }
41+
42+ // console.log(solution('JEROEN'));
43+ // console.log(solution('JAAAN'));
44+ // console.log(solution('JAAAKAN'));
45+ console . log ( solution ( 'AAABAAAAB' ) ) ;
You can’t perform that action at this time.
0 commit comments