394-字符串解码

https://blog.csdn.net/LaputaFallen/article/details/80025486

Description

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

 
 
1
2
3

---

问题描述

给定一个编码字符串，返回它的解码
编码规则为: k[encoded_string], encoded_string重复k次。注意k一定为正整数
输入字符串总是有效，没有额外的空格，方括号完美匹配
另外，输入字符串中除了使字符串重复指定次数的k以外没有其他的数字。

---

问题分析

维护两个stack

1. countstack, 存放重复次数
2. resStack, 存放字符串

迭代字符串s

1. 若遇到数字，则获取对应数字，入栈countstack
2. 若遇到’[‘, 将res(已解码字符串)入栈，置res为空(用来获取’[]’内的字符串)
3. 若遇到’]’, 出栈resStack，出栈countstack,获取重复次数k，重复res k次，添加到出栈字符串上
4. 若为字母，添加到res

---

解法

public class Solution {
    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;
    }
}
 
 

 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33

            <link href="https://csdnimg.cn/release/phoenix/mdeditor/markdown_views-e44c3c0e64.css" rel="stylesheet">
                </div>