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

---

按照编码的规则，解码给定的字符串。一个正数n后面接着"[字符串]"，表示该字符串重复n次。对于[]里面的字符串的解码，可以递归完成。完成了[]里面的字符串的解码后注意要把其后的']'吃掉。如果遇到']'或者到达字符串尾部，结束返回字符串。

代码：

class Solution {
public:
   string decodeString(string s) {
       s_ = s;
       idx = 0;
       return decodeStringHelper();
   }
private:
    string s_;
    int idx;

     string decodeStringHelper() {
        string str;
        while(idx < s_.size()) {
            if(isdigit(s_[idx])) {
                int n;
                string num;
                while(isdigit(s_[idx])) {
                    num += s_[idx];
                    idx++;
                }
                n = stoi(num);
                idx++;
                string inner_str = decodeStringHelper();
                idx++;
                for(int i = 0; i < n; ++i) {
                    str += inner_str;
                }
            }
            else if(s_[idx] == ']') return str;
            else str += s_[idx++];
        }
        return str;
    }
};