Description
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".
Solution
第一个想法,用栈(其实也不是不行)
真正开始写才发现,直接递归调用既可以了。
class Solution {
public:
string decodeString(string s) {
int number(0);
string num;
string str;
string res;
int sLen = s.size();
int i(0),j;
while(i<sLen)
{
if(isdigit(s[i]))//碰到数字就进入递归,数字后面肯定跟一个方括号
{
num = "";
while(isdigit(s[i])) num+=s[i++];
number = atoi(num.c_str());
str = "";
int c(1);
for(j = i + 1 ; j < sLen ;++j)
{
if(s[j] == '[') ++c;
else if(s[j] == ']') --c;
if (c!=0) str+=s[j];
else{
str = decodeString(str);//递归调用
i = j+1;
while(number>0)
{
res+=str;
number--;
}
break;
}
}
}
else res+=s[i++];
}
return res;
}
};
result
Runtime: 4 ms, faster than 100.00% of C++ online submissions for Decode String.
Memory Usage: 8.8 MB, less than 94.94% of C++ online submissions for Decode String.
20190409 (补打卡
tbc