-
Notifications
You must be signed in to change notification settings - Fork 7
/
decode-string.java
42 lines (39 loc) · 1.15 KB
/
decode-string.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
32
33
34
35
36
37
38
39
40
41
42
class Solution {
public String decodeString(String s) {
Stack<StringBuffer> sbSt = new Stack<>();
Stack<Integer> intSt = new Stack<>();
StringBuffer curSb = new StringBuffer();
int num = 0, n = s.length(), i = 0;
char[] cs = s.toCharArray();
while (i < n) {
if (cs[i] == '[') {
intSt.push(num);
num = 0;
sbSt.push(curSb);
curSb = new StringBuffer();
}
if (Character.isLetter(cs[i])) {
curSb.append(cs[i]);
}
if (cs[i] == ']') {
String dupSt = genDup(intSt.pop(), curSb.toString());
curSb = sbSt.pop();
curSb.append(dupSt);
}
if (cs[i] >= '0' && cs[i] <= '9') {
num = num * 10 + cs[i] - '0';
}
i++;
}
return curSb.toString();
}
public String genDup(int times, String st) {
StringBuffer sb = new StringBuffer();
for (int i = 0; i < times; i++) sb.append(st);
return sb.toString();
}
}
/**
3[a2[c]]
generateDup(2)
**/