Given an encoded string, return its 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 k is guaranteed to be a positive integer.
You may assume that the input string is always valid; there are 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 will not be input like 3a or 2[4].
Test Cases
Example 1:
Input: s = "3[a]2[bc]"
Output: "aaabcbc"
Example 2:
Input: s = "3[a2[c]]"
Output: "accaccacc"
Example 3:
Input: s = "2[abc]3[cd]ef"
Output: "abcabccdcdcdef"
Solution
class Solution {
public String decodeString(String s) {
Queue<Character> queue = new LinkedList<>();
for (char c : s.toCharArray()) queue.offer(c);
return helper(queue);
}
public String helper(Queue<Character> queue) {
StringBuilder sb = new StringBuilder();
int num = 0;
while (!queue.isEmpty()) {
char c= queue.poll();
if (Character.isDigit(c)) {
num = num * 10 + c - '0';
} else if (c == '[') {
String sub = helper(queue);
for (int i = 0; i < num; i++) sb.append(sub);
num = 0;
} else if (c == ']') {
break;
} else {
sb.append(c);
}
}
return sb.toString();
}
}