class Solution {
public:
string decodeString(string s) {
stack<int> nums;
stack<string> strs;
int num = 0;
string res;
int n = s.size();
for(int i = 0; i < n; ++i){
if(s[i] >= '0' && s[i] <= '9'){
num = num * 10 + s[i] - '0';
}else if(s[i] >='a' && s[i] <= 'z' || s[i] >='A' && s[i] <= 'Z'){
res += s[i];
}else if(s[i] == '['){ //将‘[’前的数字压入nums栈内, 字母字符串压入strs栈内
nums.push(num);
num = 0;
strs.push(res);
res = "";
}else{ //遇到‘]’时,操作与之相配的‘[’之间的字符
int times = nums.top();
nums.pop();
for(int j = 0; j < times; ++j){
strs.top() += res;
}
res = strs.top();
strs.pop();
}
}
return res;
}
};
LeetCode 394. 字符串解码
最新推荐文章于 2024-08-08 15:12:59 发布