Leetcode 394. Decode String[medium]

这两天玩high了一点都不想学习。。。
但，，，作业还是要写的。
题目：
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”.

---

递归求解。每层中，总共有2种情况：纯字母连续、数字+中括号。
这两种情况可以按照任意顺序排列出现。
其中纯字母连续直接记录；而数字+中括号时，需要括号匹配，找到正确的递归区间。

class Solution {
public:
    string decodeString(string s) {
        string ans = getstr(s, 0, s.length() - 1);
        return ans;
    }

    string getstr(string s, int l, int r) {
        //cout << l << "   " << r << endl;
        string res;
        int lt = l, rt;
        while (lt <= r) {
            while (lt <= r && s[lt] >= 'a' && s[lt] <= 'z') res = res + s[lt++];
            if (lt > r) break;

            int rep = 0;
            while (s[lt] >= '0' && s[lt] <= '9') rep = rep * 10 + s[lt++] - '0';
            rt = lt;
            int num = 0;
            while (1) {
                if (s[rt] == '[') num++;
                else if (s[rt] == ']') num--;
                if (num == 0) break;
                rt++;
            }
            string tmp = getstr(s, lt + 1, rt - 1);
            while (rep--) res += tmp;

            lt = rt + 1;
        }
        return res;
    }
};