BinarySearch_Stacks_TextEditor

//fireLUFFY
//BinarySearch: Stacks-> Text Editor

///////////////solution//////////////////

string solve(string s) {
    stack<char>ss;
    for(int i=0;i<s.length();++i)
    {
        if(ss.empty())
        {
            if((s[i]=='<')&&(s[i+1]=='-'))
            i+=1;
            else
            ss.push(s[i]);
        }
        else
        {
            if((s[i]=='<')&&(s[i+1]=='-'))
            {
                if(!ss.empty())
                {
                    ss.pop();
                    i+=1;
                }
            }
            else
            ss.push(s[i]);
        }
    }
    string sn="";
    while(!ss.empty())
    {
        sn+=ss.top();
        ss.pop();
    }
    reverse(sn.begin(),sn.end());
    return sn;
}