LeetCode 394. Decode String - Java - Stack

题目链接：394. 字符串解码

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

题解

字符是左括号，将重复次数和此次重复之前的字符串添加到栈顶
字符是右括号，取出栈顶数据，此数据是当前括号内的字符串重复次数
字符是数字，将数字添加到num中
字符是字母，将字母添加到当前字符串中

时间复杂度为 $O(n)$
空间复杂度为 $O(n)$

官方推荐使用Deque接口和ArrayDeque类代替Stack类。方法对应关系为

Deque	Stack
addFirst	push
removeFirst	pop

Java代码

/**
 * 时间复杂度为O(n)，只需要一次遍历字符串即可
 * 空间复杂度为O(n)，括号越多栈越深
 * <p>创建日期：2020-05-28 16:05:56</p>
 *
 * @author PengHao
 */
class Solution {
    public String decodeString(String s) {
        StringBuilder result = new StringBuilder();
        // 栈，保存重复次数
        Deque<Integer> integers = new ArrayDeque<>();
        // 栈，此次重复串之前的字符串
        Deque<StringBuilder> builders = new ArrayDeque<>();
        int num = 0;
        // 遍历字符串s，时间复杂度为O(n)
        for (char ch : s.toCharArray()) {
            if (ch == '[') {
                // ch是左括号，将重复次数和此次之前的字符串入栈
                integers.addFirst(num);
                builders.addFirst(result);
                // 重置次数和结果字符串
                num = 0;
                result = new StringBuilder();
            } else if (ch == ']') {
                // ch是右括号，将该括号中的字符串(result)重复pop次，
                // pop是该括号前面的数据(即栈顶数据)
                StringBuilder temp = new StringBuilder();
                int pop = integers.removeFirst();
                for (int i = 0; i < pop; i++) {
                    temp.append(result);
                }
                // 将此次重复串前面的字符串从栈顶取出并加上此次重复的字符串
                result = builders.removeFirst().append(temp);
            } else if (Character.isDigit(ch)) {
                // ch是数字
                num = num * 10 + Character.digit(ch, 10);
            } else {
                // ch是字母
                result.append(ch);
            }
        }
        return result.toString();
    }
}

参考

1、字符串解码（辅助栈法 / 递归法，清晰图解） - Krahets