LeerCode 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 thatk 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 or2[4].

Examples:

s = "3[a]2[bc]", return "aaabcbc".
s = "3[a2[c]]", return "accaccacc".
s = "2[abc]3[cd]ef", return "abcabccdcdcdef".

思路：用栈的方法，当遇到数字时，压入数字栈sc，当遇到字母或者' [ ' 时压入str栈，当遇到' ] ' 时，把前面 ' [ ' 之后的串解码

算法：

class Solution {
public:
string decodeString(string s) {
	stack<int> sc;
	stack<string> ss;
	int idx = 0;
	while (idx < s.length()) {
		
		if (isdigit(s[idx])) {
			int n = 0;
			while (isdigit(s[idx]))
				n = n * 10 + (s[idx++] - '0');
			sc.push(n);
		}
		else if (s[idx] == ']') {
			string t = "";
			while (ss.top() != "[") {
				t = ss.top()+t;
				ss.pop();
			}
			//reverse(t.begin(), t.end());
			ss.pop();

			int time = sc.top();
			sc.pop();

			string temp = "";
			while (time-- > 0)
				temp += t;
			ss.push(temp);
			idx++;

		}
		else {
			ss.push(string(1, s[idx++]));
		}
	}
	
	string temp="";
	while (!ss.empty()) {
		temp = ss.top()+temp;
		ss.pop();
	}
	//cout << temp;
	return temp;
}
};

后来看solution，发现了一个十分优雅的算法，大致思路是通过循环调用自己，每次遇到%d[%s]这样形式的string时就调用自己解码，最后一次的返回结果就是最终结果

算法：

class Solution {
public:
    string decodeString(const string& s, int& i) {
        string res;
        
        while (i < s.length() && s[i] != ']') {
            if (!isdigit(s[i]))
                res += s[i++];
            else {
                int n = 0;
                while (i < s.length() && isdigit(s[i]))
                    n = n * 10 + s[i++] - '0';
                    
                i++; // '['
                string t = decodeString(s, i);
                i++; // ']'
                
                while (n-- > 0)
                    res += t;
            }
        }
        
        return res;
    }

    string decodeString(string s) {
        int i = 0;
        return decodeString(s, i);
    }
};