Decode String （LeetCode）

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; 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 {
    public String decodeString(String s) {
        Stack<Integer> numStack = new Stack();
        Stack<String> strStack = new Stack();
        String res = "";
        for (int i = 0; i < s.length(); i++) {
            if (Character.isDigit(s.charAt(i))) {
                int num = 0;
                while (Character.isDigit(s.charAt(i))) {
                    num = 10 * num + (s.charAt(i) - '0');
                    i++;
                }
                //循环里面多加了一次1
                i--;
                numStack.push(num);
            } else if (s.charAt(i) == '[') {
                strStack.push(res);
                res = "";//这里需要注意，中间值放到stack中后，要置成“”
            } else if (s.charAt(i) == ']') {
                String tmp = strStack.pop();
                int num = numStack.pop();
                for (int j = 0; j < num; j++) {
                    tmp += res;
                }
                res = tmp;
            } else {
                res += s.charAt(i);
            }
        }
        return res;
    }
}

 

[LeetCode] 394. Decode String 解码字符串