394. Decode String

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".

解码字符

思路很清晰，这种括号匹配的题肯定是用stack。

不同点在于，我用的一个stack，discuss用的两个，看着清晰一些。

mine: 

    public String decodeString(String s) {
        Stack<Character> stack = new Stack<>();
        for (char c : s.toCharArray()) {
            switch (c) {
                case ']':
                    //获取字符串
                    StringBuilder builder = new StringBuilder();
                    while (!stack.isEmpty() && Character.isLetter(stack.peek())) {
                        builder.append(stack.pop());
                    }
                    stack.pop();//移出[
                    
                    //获取重复次数
                    StringBuilder num = new StringBuilder();
                    while (!stack.isEmpty() && Character.isDigit(stack.peek())) {
                        num.append(stack.pop());
                    }
                    int count = num.length() == 0 ?
                         0 : Integer.parseInt(num.reverse().toString());
                    
                    //向stack中重复放入字符串count次
                    pushRepeat(stack, builder.toString(), count);
                    break;
                default:
                    stack.push(c);
                    break;
            }
        }
        
        char[] array = new char[stack.size()];
        for (int i = array.length - 1; i >=0; i--) {
            array[i] = stack.pop();
        }
        return new String(array);
    }
    
    private void pushRepeat(Stack<Character> stack, String s, int count) {
        char[] array = s.toCharArray();
        for (int i = 0; i < count; i++) {
            for (int j = array.length - 1; j >= 0; j--) {
                stack.push(array[j]);
            }
        }
    }

discuss

    public String decodeString(String s) {
        String res = "";
        Stack<Integer> countStack = new Stack<>();//存放重复次数
        Stack<String> resStack = new Stack<>();//存放字符串
        int idx = 0;
        while (idx < s.length()) {
            if (Character.isDigit(s.charAt(idx))) {//遇到数字，那么就把整个数字取出来
                int count = 0;
                while (Character.isDigit(s.charAt(idx))) {
                    count = 10 * count + (s.charAt(idx) - '0');
                    idx++;
                }
                countStack.push(count);
            }
            else if (s.charAt(idx) == '[') {
                resStack.push(res);
                res = "";
                idx++;
            }
            else if (s.charAt(idx) == ']') {
                StringBuilder temp = new StringBuilder (resStack.pop());
                int repeatTimes = countStack.pop();
                for (int i = 0; i < repeatTimes; i++) {
                    temp.append(res);
                }
                res = temp.toString();
                idx++;
            }
            else {
                res += s.charAt(idx++);//拼接当前字符
            }
        }
        return res;
    }