Given an encoded string, return it's decoded string.
The encoding rule is: k[encoded_string]
, where the encoded_string inside the square brackets is being repeated exactly k times. Note that kis guaranteed to be a positive integer.
You may assume that the input string is always valid; No extra white spaces, square brackets are well-formed, etc.
Furthermore, you may assume that the original data does not contain any digits and that digits are only for those repeat numbers, k. For example, there won't be input like 3a
or 2[4]
.
Examples:
s = "3[a]2[bc]", return "aaabcbc". s = "3[a2[c]]", return "accaccacc". s = "2[abc]3[cd]ef", return "abcabccdcdcdef".
public class Solution {
public String decodeString(String s) {
String res = "";
Stack<Integer> numStack = new Stack<Integer>();
Stack<String> resStack = new Stack<String>();
char[] array = s.toCharArray();
int i = 0;
while (i < array.length) {
char c = array[i];
if (Character.isDigit(c)) {
int count = 0;
while (Character.isDigit(array[i])) {
count = 10 * count + array[i] - '0';
i++;
}
numStack.push(count);
} else if (c == '[') {
resStack.push(res);
res = "";
i++;
} else if (c == ']') {
StringBuilder sb = new StringBuilder(resStack.pop());
int num = numStack.pop();
for (int j = 0; j < num; j++) {
sb.append(res);
}
res = sb.toString();
i++;
} else {
res += array[i++];
}
}
return res;
}
}