标签：git 题目 number numbers odi sub and diff sid
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 class Solution { 2 public: 3 string decodeString(string s) { 4 stack<string> strs; 5 stack<int> counts; 6 string result = ""; 7 int cnt = 0; 8 for (int i = 0; i < s.size(); i++) { 9 if(s[i] <= ‘9‘ && s[i] >= ‘0‘) { 10 cnt = cnt*10 + s[i] - ‘0‘; 11 cout << "number = " << cnt << endl; 12 } else if (s[i] == ‘[‘) { 13 cout << "[" << endl; 14 counts.push(cnt); 15 strs.push(result); 16 result.clear(); 17 cnt = 0; 18 } else if (s[i] == ‘]‘) { 19 int cur_cnt = counts.top(); 20 cout << "]" << " cur_cnt = " << cur_cnt << endl; 21 counts.pop(); 22 for (int j = 0; j < cur_cnt; j++) { 23 strs.top() += result; 24 } 25 result = strs.top(); 26 strs.pop(); 27 } else { 28 result += s[i]; 29 cout << "result += " << s[i] << endl; 30 } 31 } 32 return strs.empty()? result:strs.top(); 33 } 34 };
注意：
‘[‘后记得要清空result，初始化cnt为0。
标签：git 题目 number numbers odi sub and diff sid
原文地址：http://www.cnblogs.com/fqmai/p/6014631.html
