-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.java
31 lines (27 loc) · 1.11 KB
/
Solution.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
class Solution {
public String decodeString(String s) {
LinkedList<String> stack = new LinkedList<String>();
StringBuilder sb = new StringBuilder();
for (char c : s.toCharArray()) {
if (c == ']') {
StringBuilder strSb = new StringBuilder();
while (stack.size() > 0 && !stack.peek().equals("["))
strSb.insert(0, stack.pop());
stack.pop();
StringBuilder intSb = new StringBuilder();
while (stack.size() > 0 && stack.peek().matches("\\d+"))
intSb.insert(0, stack.pop());
String temp = strSb.toString();
strSb = new StringBuilder();
for (int i = 0; i < Integer.valueOf(intSb.toString()); i++)
strSb.append(temp);
stack.push(strSb.toString());
} else {
stack.push(String.valueOf(c));
}
}
while (stack.size() > 0)
sb.append(stack.pollLast());
return sb.toString();
}
}