给定一系列字符串集合,合并有交集的集合,合并完后集合之间无交集

#pragma warning(disable:4786)

#include <iostream> 
#include <map> 
#include <set>
#include <vector> 

using namespace std; 

int main()
{ 
	//初始化数据
	vector<vector<char*> > v;
	vector<char*> v1;
	v1.push_back("aaa");
	v1.push_back("bbb");
	v1.push_back("ccc");
	v.push_back(v1);
	
	v1.clear();
	v1.push_back("bbb");
	v1.push_back("ddd");
	v.push_back(v1);
	
	v1.clear();
	v1.push_back("eee");
	v.push_back(v1);
	
	v1.clear();
	v1.push_back("ggg");
	v1.push_back("fff");
	v.push_back(v1);
	
	v1.clear();
	v1.push_back("ddd");
	v1.push_back("hhh");
	v.push_back(v1);
	
	v1.clear();

	int len = v.size();
	int i, j;
	int *a;

	map<char*, int*> m;
	vector<vector<char*> >::iterator v_iter;
	map<char*, int*>::iterator m_iter;
	
	//查看每个字符串在哪些集合出现过
	for(v_iter=v.begin(); v_iter!=v.end(); v_iter++)
	{
		for(i=0; i<(*v_iter).size(); i++)
		{
			m_iter = m.find((*v_iter)[i]);
			if(m_iter == m.end())
			{
				a = new int[len];
				for(j=0; j<len; j++)
					a[j] = -1;
				a[v_iter-v.begin()] = 0;
				m.insert(pair<char*, int*>((*v_iter)[i], a));
			}
			else
			{
				a = m_iter->second;
				a[v_iter-v.begin()] = 0;
			}
		}
	}

	int *b = new int[len];
	for(i=0; i<len; i++)
		b[i] = i;

	bool b_front = false;
	int front;
	
	//如果出现在多个集合中,只取第一次出现的集合的id
	for(m_iter=m.begin(); m_iter!=m.end(); m_iter++)
	{
		b_front = false;
		a = m_iter->second;
		for(i=0; i<len; i++)
		{
			if(a[i]==0)
			{
				if(!b_front)
				{
					front = i;
					b_front = true;
				}
				else
				{
					b[i] = front;
				}
			}
		}
	}
	
	//记录集合合并后的归属
	for(i=0; i<len; i++)
		if(b[i]!=i)
			b[i]=b[b[i]];

	map<int, vector<char*> > m_union;
	map<int, vector<char*> >::iterator m_u_iter;

	//添加合并后的字符串
	for(m_iter=m.begin(); m_iter!=m.end(); m_iter++)
	{
		a = m_iter->second;
		for(i=0; i<len; i++)
			if(a[i]==0)
				break;
		j = b[i];
		m_u_iter = m_union.find(j);
		if(m_u_iter == m_union.end())
		{
			v1.clear();
			m_union.insert(pair<int, vector<char*> >(j, v1));
			m_u_iter = m_union.find(j);
		}
		(m_u_iter->second).push_back(m_iter->first);
	}


	//输出合并后的集合
	for(m_u_iter=m_union.begin(); m_u_iter!=m_union.end(); m_u_iter++)
	{
		copy((m_u_iter->second).begin(), (m_u_iter->second).end(), ostream_iterator<char*>(cout, " "));
		cout<<endl;
	}

	delete []b;

	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值