[LeetCode] 394. Decode String

Problem:

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. 字母 → 单个字母直接添加到结果串中 | [ ]中的串根据其前面匹配的整数添加对应长度的串到结果串中

关键点：由于 [ ] 允许内嵌 [ ]，如例2，所以需要通过DFS找出一个[ ]中内嵌的 k[encoded_string]（不存

在则返回空串）

Solution:

class Solution {
public:
    string decodeString(string s) {
        int pos = 0;
        return dfs(s, pos);
    }
    
    string dfs(string& s, int& pos) {
        string dstring = "";
        while (pos < s.length() && s[pos] != '[' && s[pos] != ']') {
            if (isdigit(s[pos])) {         // 匹配到数字
                int num = 0;
                while (pos < s.length() && isdigit(s[pos]))
                    num = num * 10 + s[pos++] - '0';   // 连续数字转化为代表字母个数的整数值
                pos++; // 跳过'['                      // 数字后的第一个非数字字符必定为'['
                string inners = dfs(s, pos);           // 深搜找出内嵌k[encoded_string]
                pos++; // 跳过 ']'
                
                while (num-- > 0)
                    dstring += inners;
            } else {                      // 匹配到单个字母
                dstring += s[pos++];
            }
        }
        return dstring;
    }
};