【LeetCode】【HOT】394. 字符串解码（栈）

【LeetCode】【HOT】394. 字符串解码

package hot;

import java.util.LinkedList;

public class Solution394 {
    public static void main(String[] args) {
        String s = "3[a2[c]]";
        Solution394 solution = new Solution394();
        System.out.println(solution.method(s));
    }

    private String method(String s){
        StringBuilder res = new StringBuilder();
        int multi = 0;
        LinkedList<String> stack_res = new LinkedList<>();
        LinkedList<Integer> stack_multi = new LinkedList<>();
        for(char c : s.toCharArray()){
            if(c == '['){
                stack_multi.addLast(multi);
                multi = 0;
                stack_res.addLast(res.toString());
                res = new StringBuilder();
            }else if(c == ']'){
                int temp_multi = stack_multi.removeLast();
                StringBuilder temp = new StringBuilder();
                for(int i = 0; i < temp_multi; i++){
                    temp.append(res);
                }
                res = new StringBuilder(stack_res.removeLast() + temp);
            }else if(c >= '0' && c <= '9'){
                multi = multi * 10 + Integer.parseInt(String.valueOf(c));
            }else{
                res.append(c);
            }
        }
        return res.toString();
    }
}

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