UVA 12504 Updating a Dictionary

本文介绍了一个程序,用于解析两个配置字符串并比较它们之间的不同之处。通过将配置字符串转换为键值对,程序能够识别哪些配置项被添加、删除或更改,并以特定格式输出这些差异。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

#include<iostream>
#include<vector>
#include<string>
#include<type_traits>
#include<sstream>
#include<tuple>
#include<bitset>
#include<regex>
#include<set>
#include<stack>
#include<queue>
#include<map>
using namespace std;

int T;

void Explain(map<string,string>& str2str,string source){
	vector<int> index1, index2;
	for (int i = 0; i < source.size(); i++){
		if (source[i] == ':') index1.push_back(i);
		if (source[i] == ',') index2.push_back(i);
	}
	index2.push_back(-1);
	int pos1 = 0;
	for (int i = 0; i < index1.size(); i++){
		string key = source.substr(pos1,index1[i]-pos1);
		string value;
		if (index2[i] != -1){
			value = source.substr(index1[i] + 1, index2[i] - index1[i] - 1);
			pos1 = index2[i] + 1;
		}
		else{
			value = source.substr(index1[i]+1);
		}
		str2str[key] = value;
	}
}

int main(){
	cin >> T;
	string del;
	getline(cin,del);
	while (T--){
		string s1;
		string s2;
		getline(cin,s1);
		getline(cin,s2);
		s1 = s1.substr(1,s1.size()-2);
		s2 = s2.substr(1,s2.size()-2);
		map<string, string> ms1;
		map<string, string> ms2;
		Explain(ms1, s1);
		Explain(ms2,s2);
		vector<string> Add;
		vector<string> Remove;
		vector<string> Change;
		auto it1 = ms1.begin();
		auto it2 = ms2.begin();
		while (it1 != ms1.end() && it2 != ms2.end()){
			string key1 = it1->first;
			string value1 = it1->second;
			string key2 = it2->first;
			string value2 = it2->second;
			if (key1 == key2){
				if (value1 != value2){
					Change.push_back(key1);
				}
				it1++;
				it2++;
			}
			else{
				if (ms2.find(key1) == ms2.end()){
					Remove.push_back(key1);
					it1++;
				}
				if (ms1.find(key2) == ms1.end()){
					Add.push_back(key2);
					it2++;
				}
			}
		}
		while (it1 != ms1.end()){
			Remove.push_back(it1->first);
			it1++;
		}
		while (it2 != ms2.end()){
			Add.push_back(it2->first);
			it2++;
		}
		bool flag = false;
		if (Add.size()){
			cout << "+";
			flag = true;
			for (int i = 0; i < Add.size(); i++){
				cout << Add[i];
				if (i < Add.size() - 1) cout << ',';
			}
			cout << endl;
		}
		
		if (Remove.size()){
			flag = true;
			cout << "-";
			for (int i = 0; i < Remove.size(); i++){
				cout << Remove[i];
				if (i < Remove.size() - 1) cout << ",";
			}
			cout << endl;
		}
		
		if (Change.size()){
			flag = true;
			cout << "*";
			for (int i = 0; i < Change.size(); i++){
				cout << Change[i];
				if (i < Change.size() - 1) cout << ",";
			}
			cout << endl;
		}
		if (!flag){
			cout << "No changes" << endl;
		}
		cout << endl;
	}
	//system("pause");
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值