合并两个线性表

最新推荐文章于 2023-05-25 16:12:13 发布

weixin_30300225

最新推荐文章于 2023-05-25 16:12:13 发布

阅读量76

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/javaspring/archive/2011/08/30/2656474.html

版权

严蔚敏版数据结构，算法2.1

#include <iostream>
using namespace std;
typedef int element;
#define maxsize 100
typedef struct
{
  element aa[maxsize];
  int last;
}sqlist;
int compare(sqlist *la,int x)
{
  int flag=0;
  int i;
  for(i=0;i<=la->last;++i)
  {
	  if(la->aa[i]==x)
	  {flag=1;break;}
  }
  return flag;
}
void uunion(sqlist *la,sqlist *lb)
{
	int x=la->last;
	int y=0,i,count=0;
	for(i=0;i<=lb->last;++i)
	{
	  if(!compare(la,lb->aa[i]))
	  {
		  la->aa[++x]=lb->aa[i];
		  count++;
	  }
	}
	la->last=la->last+count;
}
int main()
{
  sqlist *la,*lb;
  int len,i;
  la=(sqlist*)malloc(sizeof(sqlist));
  cout<<"输入链表a的长度"<<endl;
  cin>>len;
  la->last=len-1;
  cout<<"输入元素"<<endl;
  for(i=0;i<len;++i)
	  cin>>la->aa[i];
lb=(sqlist*)malloc(sizeof(sqlist));
  cout<<"输入链表b的长度"<<endl;
  cin>>len;
  lb->last=len-1;
  cout<<"输入元素"<<endl;
  for(i=0;i<len;++i)
	  cin>>lb->aa[i];
  uunion(la,lb);
  for(i=0;i<=la->last;++i)
	  cout<<la->aa[i]<<"  ";
  cout<<endl;
  return 0;
}

转载于:https://www.cnblogs.com/javaspring/archive/2011/08/30/2656474.html