Problem R: 栈小游戏

#include <iostream>
#include <vector>
#include <stack>
using namespace std;
class Operation
{
public :
    vector<int> data;
    stack<int> iStack;
    vector<char> opers;
    vector<int> result;

    void inputData()
    {
        int temp;
        while(cin>>temp)
        {
            if(temp==0)
                break;
            else
            data.push_back(temp);
        }
    }
    void inputOpers()
    {
        char temp;
        while(cin>>temp)
        {
            if(temp==‘E‘||temp==‘e‘)
                break;
            else if(temp==‘i‘||temp==‘I‘||temp==‘o‘||temp==‘O‘)
                opers.push_back(temp);
        }
    }
    void showResult()
    {
        int j1=0, j2=0;
        cout<<"The pop sequence is:";
        for(int i=0; i<opers.size(); i++)
        {
            if(opers[i]==‘i‘||opers[i]==‘I‘)
            {
                if(j1<data.size())//当data里的数据数量满足不了入栈操作时停止入栈
                iStack.push(data[j1++]);
            }
            else if(opers[i]==‘o‘||opers[i]==‘O‘)
            {
                if(!iStack.empty())//当堆栈为空时停止出栈
                {
                    cout<<" "<<iStack.top();
                    result.push_back(iStack.top());//将出栈数据存到 result
                    iStack.pop();
                }
            }
        }
            if(result.empty())//result 为空表明无数据出栈，输出empty
            cout<<"Empty.";
            cout<<endl;
    }
    void clearData()
    {
        data.clear();
        opers.clear();
        result.clear();
        while(!iStack.empty())// 堆栈无clear 用法。
            iStack.pop();
    }
};
int main()
{
    Operation myOp;
    int cases;
    cin>>cases;
    for (int i = 0; i < cases; i++)
    {
        myOp.clearData();
        myOp.inputData();
        myOp.inputOpers();
        myOp.showResult();
    }
    return 0;
}