394. Decode String
来源:互联网 发布:北美海关数据 编辑:程序博客网 时间:2024/06/03 13:54
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".
class Solution {public: string decodeString(string s) { stack<char> t;vector<int> nums;int count=0;string tmp="",result="";while(count<s.length()){if(s[count]==']'){while(t.top()!='['){tmp.push_back(t.top());t.pop();}t.pop();while(!t.empty()&&isdigit(t.top())){nums.push_back(t.top()-'0');t.pop();}int num=0; reverse(nums.begin(),nums.end());for (int i=0;i<nums.size();i++){num=num*10+nums[i];}reverse(tmp.begin(),tmp.end());for (int i = 0; i < num; ++i){result+=tmp;}for (int i = 0; i < result.length(); ++i){t.push(result[i]);}result="";tmp="";count++;nums.clear();continue;}t.push(s[count]);count++;}result="";while(!t.empty()){result.push_back(t.top());t.pop();}reverse(result.begin(),result.end());return result; }};
阅读全文