We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 33d3e13 commit 52ea32eCopy full SHA for 52ea32e
LiiNi-coder/202511/22 PGM 큰 수 만들기.md
@@ -0,0 +1,33 @@
1
+```java
2
+import java.util.*;
3
+
4
+class Solution {
5
+ public String solution(String number, int k) {
6
+ int len = number.length() - k;
7
8
+ Deque<Character> stack = new ArrayDeque<>();
9
10
+ for(int i = 0; i < number.length(); i++){
11
+ char c = number.charAt(i);
12
13
+ while(!stack.isEmpty()){
14
+ if(k<=0 || stack.peekLast() >= c)
15
+ break;
16
+ stack.pollLast();
17
+ k--;
18
+ }
19
+ stack.offerLast(c);
20
21
22
+ while(stack.size() > len){
23
24
25
+ StringBuilder sb = new StringBuilder();
26
27
+ sb.append(stack.pollFirst());
28
29
+ return sb.toString();
30
31
+}
32
33
+```
0 commit comments