OPENJUDGE LIST

最新推荐文章于 2024-01-08 21:48:21 发布

christloo

最新推荐文章于 2024-01-08 21:48:21 发布

阅读量461

点赞数

CC 4.0 BY-SA版权

文章标签： include iterator string input merge pair

本文链接：https://blog.csdn.net/christloo/article/details/7531000

本文介绍了一个使用C++实现的列表映射操作程序，该程序通过解析输入指令来完成新建列表、添加元素、合并列表、去重及输出等功能。通过对用户输入的字符串流进行解析，实现了对列表的操作。

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

# include <iostream>
# include <list>
# include <string>
# include <map>
# include <sstream>
# include <cstdio>

using namespace std;

map<int,list<int> > listMap;

void printList(list<int>& l)
{
	list<int>::iterator i;
	for ( i = l.begin(); i != l.end(); i++ )
	{
		printf("%d ",*i);
	}
	printf("\n");
}

void commandTranslator(stringstream& s,string& str)
{
	int opr1 = 0;
	int opr2 = 0;		//operators for instructions
	list<int> l;
	map<int,list<int> >::iterator i;
	map<int,list<int> >::iterator j;
	if ( str == "new" )
	{
		s >> opr1;
		listMap.insert(make_pair(opr1,l));
	}
	if ( str == "add" )
	{
		s >> opr1;
		s >> opr2;
		i = listMap.find(opr1);
		if ( i != listMap.end() )
		{
			i->second.push_back(opr2);
		}
		else return;
	}
	if ( str == "merge" )
	{
		s >> opr1;
		s >> opr2;
		i = listMap.find(opr1);
		j = listMap.find(opr2);
		if ( i != listMap.end() && j != listMap.end() )
		{
			i->second.merge(j->second);
		}
		else return;
	}
	if ( str == "unique" )
	{
		s >> opr1;
		i = listMap.find(opr1);
		if ( i != listMap.end() )
		{
			i->second.sort();
			i->second.unique();
		}
		else return;
	}
	if ( str == "out" )
	{
		s >> opr1;
		i = listMap.find(opr1);
		if ( i != listMap.end() )
		{
			i->second.sort();
			printList(i->second);
		}
		else return;
	}	
}

int main()
{
	int n = 0;
	stringstream s;	//Storage For Instructions
	int commandNo = 0;
	char input[100];
	string inputString;
	string instruction;	//Instruction
	
	cin >> n;
	cin.ignore();
	for ( int i = 0; i < n; i++ )
	{
		gets(input);
		inputString = input;
		stringstream s(inputString);
		s >> instruction;
		commandTranslator(s,instruction);	//Decode And RunInstructions
	}
	return 0;
}