更新字典 （Updating a Dictionary,UVa12504)

题目描述：

解题思路：

1.根据：和，获得字符串

2.使用两个map进行比较；

#include <iostream>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
map<string, string>::iterator it;
map<string,string> dict[2];
string str[105];
int main(int argc, char *argv[])
{
    int t ;
    cin >> t;
    while(t--)
    {
        dict[0].clear(), dict[1].clear();
        for(int i=0;i<2;i++)
        {
            string s,t1,t2;
            cin >> s ;
            int j=1,len = s.size() ;
            while(j < len && len > 2)
            {
                while(s[j]!=':') t1 += s[j++] ; ++j ;
                while(s[j]!=',' && s[j]!='}') t2 += s[j++] ; ++j ;
                dict[i][t1] = t2 ;
                t1 = t2 = "" ; 
            } 
        }    
        int a=0,s=0,m=0;
        for(it=dict[1].begin();it != dict[1].end();it++)
            if(!dict[0].count(it->first)) str[a++] = it->first;
        if(a)
        {
            sort(str,str+a);
            cout << "+" << str[0]  ;
            for(int i = 1; i < a; ++i) cout << ',' << str[i];    
            puts("");
        }
        for(it=dict[0].begin();it != dict[0].end();it++)
            if(!dict[1].count(it->first)) str[s++] = it->first;
        if(s)
        {
            sort(str,str+s);
            cout << "-" << str[0]  ;
            for(int i = 1; i < s; ++i) cout << ',' << str[i];
            puts("");    
        }
        for(it=dict[1].begin();it != dict[1].end();it++)
            if(dict[0].count(it->first)&&dict[0][it->first] != it->second) str[m++] = it->first;
        if(m)
        {
            sort(str,str+m);
            cout << "*" << str[0]  ;
            for(int i = 1; i < m; ++i) cout << ',' << str[i];    
            puts("");
        }
        if(!(a || s || m)) puts("No changes");
        puts("");
    }
    return 0;
}