//
// Created by ߳ on 2023/9/8.
//

#ifndef LEETCODE_SOLUTION72_H
#define LEETCODE_SOLUTION72_H

#include "bits/stdc++.h"
using namespace std;
class solution72 {
public:
    vector<int>nums;
    vector<string>str;
    string laststr="";
    string decodeString(string s) {
        int i=0;
        while(i<s.size()){
            int num=0;
            int flag=0;
            while(isdigit(s[i])){
                num=(s[i]-'0')+10*num;
                i++;
                flag=1;
            }
            if(flag)
            nums.emplace_back(num);
            string c="";
            flag=0;
            while(isalpha(s[i])){
                c+=s[i];
                i++;
                flag=1;
            }
            if(flag)
            str.emplace_back(c);
            if(s[i]=='['){
                str.emplace_back(string(1,s[i]));
                i++;
            }
            if(s[i]==']'){
                int num=nums.back();
                nums.pop_back();
                string s="";
                while(str.back()!="["){
                    s.insert(0,str.back());
                    str.pop_back();
                }
                str.pop_back();
                string top="";
                for(int i=0;i<num;i++){
                    top+=s;
                }
                str.emplace_back(top);
                i++;
            }
        }
        for(auto s:str){
            laststr+=s;
        }
        return laststr;
    }
};


#endif //LEETCODE_SOLUTION72_H