stack模拟 括号匹配

#include<iostream>
#include<stack>
using namespace std;
int main()
{
    int ncase,num;
    char str;
    cin>>ncase;
    while(ncase--)
    {
        cin>>num;
        stack<char> st;
        for(int i=0;i<num;i++)
        {
            cin>>str;
            if(!st.empty()&&st.top()=='>'&&str=='<')
            {
                st.pop();
                continue;
            }
            else
                st.push(str);
        }
        if(st.empty()) cout<<"legal\n"<<endl;
        else cout<<"illegal\n"<<endl;
    }
    return 0;
}