UVA - 11988 Broken Keyboard (a.k.a. Beiju Text)

题意：省略

思路：链表的简单应用，便于插入

#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        using namespace std; int main(){ list
       
         li; list
        
         ::iterator it; for (string str; cin>>str;){ li.clear(); it = li.begin(); for (int i = 0; i < str.size(); i++){ if (str[i] == '[') it = li.begin(); else if (str[i] == ']') it = li.end(); else li.insert(it,str[i]); } for (it = li.begin(); it != li.end(); it++) printf("%c",*it); printf("\n"); } return 0; }