问题:
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 k is 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".
解决:
① 递归解决。
class Solution {//4ms
int p = 0;
public String decodeString(String s) {
StringBuilder sb = new StringBuilder();
String tmpk = "";
for (int i = p;i < s.length();i ++){
if (s.charAt(i) != '[' && s.charAt(i) != ']' && !Character.isDigit(s.charAt(i))){//字符直接添加
sb.append(s.charAt(i));
}else if (Character.isDigit(s.charAt(i))){//数字记录下来
tmpk += s.charAt(i);
}else if (s.charAt(i) == '['){//递归
p = i + 1;
String next = decodeString(s);
for (int k = Integer.valueOf(tmpk);k > 0;k --){//重复添加
sb.append(next);
}
tmpk = "";
i = p;
}else if (s.charAt(i) == ']'){//返回递归结果
p = i;
return sb.toString();
}
}
return sb.toString();
}
}
② 使用栈辅助。
class Solution { //5ms
public String decodeString(String s) {
Stack<Integer> inStack = new Stack<>();
Stack<StringBuilder> charStack = new Stack<>();
StringBuilder sb = new StringBuilder();
int k = 0;
for (char c : s.toCharArray()){
if (Character.isDigit(c)){
k = k * 10 + c - '0';
}else if (c == '['){
inStack.add(k);
charStack.add(sb);
k = 0;
sb = new StringBuilder();
}else if (c == ']'){
StringBuilder tmp = sb;
sb = charStack.pop();
for (int i = inStack.pop();i > 0;i --){
sb.append(tmp);
}
}else {
sb.append(c);
}
}
return sb.toString();
}
}