Updating a Dictionary

发布时间:2017-2-28 11:18:44 编辑:www.fx114.net 分享查询网我要评论
本篇文章主要介绍了"Updating a Dictionary",主要涉及到Updating a Dictionary方面的内容,对于Updating a Dictionary感兴趣的同学可以参考一下。

Updating a Dictionary Time Limit:1000MS    Memory Limit:131072KB    64bit IO Format:%lld & %llu SubmitStatusPracticeCSU 1113 Description In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given an old dictionary and a new dictionary, find out what were changed. Each dictionary is formatting as follows: {key:value,key:value,...,key:value} Each key is a string of lower-case letters, and each value is a non-negative integer without leading zeros or prefix '+'. (i.e. -4, 03 and +77 are illegal). Each key will appear at most once, but keys can appear in any order. Input The first line contains the number of test cases T (T<=1000). Each test case contains two lines. The first line contains the old dictionary, and the second line contains the new dictionary. Each line will contain at most 100 characters and will not contain any whitespace characters. Both dictionaries could be empty. WARNING: there are no restrictions on the lengths of each key and value in the dictionary. That means keys could be really long and values could be really large. Output For each test case, print the changes, formatted as follows: ·First, if there are any new keys, print '+' and then the new keys in increasing order (lexicographically), separated by commas. ·Second, if there are any removed keys, print '-' and then the removed keys in increasing order (lexicographically), separated by commas. ·Last, if there are any keys with changed value, print '*' and then these keys in increasing order (lexicographically), separated by commas. If the two dictionaries are identical, print 'No changes' (without quotes) instead. Print a blank line after each test case. Sample Input 3 {a:3,b:4,c:10,f:6} {a:3,c:5,d:10,ee:4} {x:1,xyz:123456789123456789123456789} {xyz:123456789123456789123456789,x:1} {first:1,second:2,third:3} {third:3,second:2} Sample Output +d,ee -b,f *c No changes -first 容器使用,#include<sstream>很强。 #include<iostream> #include<algorithm> #include<cctype> #include<string> #include<sstream> #include<map> #include<cstdio> #include<vector> using namespace std; void make_dict(string s,map<string,string>& m,vector<string>& keys) { for(int i=0;i<s.size();i++) { if(!isalpha(s[i])&&!isdigit(s[i])) { s[i]=' '; } } stringstream ss(s); string key,value; while(ss>>key) { ss>>value; m[key]=value; keys.push_back(key); } } void print_list(const vector<string>v) { for(int i=0;i<v.size();i++) { if(i!=0) { cout<<','; } cout<<v[i]; } cout<<endl; } int main() { int t; cin>>t; while(t--) { string d1,d2; vector<string>all,add,removed,changed; map<string,string>m1,m2; cin>>d1>>d2; make_dict(d1,m1,all); make_dict(d2,m2,all); sort(all.begin(),all.end()); all.erase(unique(all.begin(),all.end()),all.end()); for(int i=0;i<all.size();i++) { string key=all[i]; if(!m1.count(key)&&m2.count(key)) add.push_back(key); if(m1.count(key)&&!m2.count(key)) removed.push_back(key); if(m1.count(key)&&m2.count(key)&& m1[key] != m2[key]) changed.push_back(key); } int flag=0; if(!add.empty()) { flag=1; cout<<'+'; print_list(add); } if(!removed.empty()) { flag=1; cout<<'-'; print_list(removed); } if(!changed.empty()) { flag=1; cout<<'*'; print_list(changed); } if(!flag) { cout<<"No changes"<<endl; } cout<<endl; } return 0; }

上一篇:Python编程系列教程第14讲——继承
下一篇:nvelocity的单例用法

相关文章

相关评论

本站评论功能暂时取消,后续此功能例行通知。

一、不得利用本站危害国家安全、泄露国家秘密,不得侵犯国家社会集体的和公民的合法权益,不得利用本站制作、复制和传播不法有害信息!

二、互相尊重,对自己的言论和行为负责。