实验1.2.cpp

一些数据结构的基本实验的解法,和实用哦,欢迎借鉴,交流

#include <stdio.h>
#include "sqlist.h"
int i=1,j,ai,bj,aj;

void DelExtralNOde(sqlist &L)
{	
	//int i,j;
	L.len=Listlength_sq(L);i=1;
	while(i<=L.len)
	{
		GetElem_sq(L,i,ai);
		j=i+1;GetElem_sq(L,j,aj);
		if(ai==aj) ListDelete_sq(L,j);
		else i++;
	}

 }


void MergeList(sqlist &La,sqlist &Lb)
{
	sqlist Lc;
	Initlist_sq(Lc);
	int i=j=1;
	int K=0;
	La.len=Listlength_sq(La);Lb.len=Listlength_sq(Lb);
	while((i<=La.len) && (j<=Lb.len))
	{	
		GetElem_sq(La,i,ai);GetElem_sq(Lb,j,bj);
		if(ai<=bj){ListInsert_sq(Lc,++K,ai);}
		else {ListInsert_sq(Lc,++K,bj);}
		while(i<=La.len)
		{GetElem_sq(La,i++,ai);ListInsert_sq(Lc,++K,ai);}
		while(j<=Lb.len)
		{GetElem_sq(La,i++,bj);ListInsert_sq(Lc,++K,bj);}
	}
		
	ClearList_sq(La);ClearList_sq(Lb);
	DelExtralNOde(Lc);
	//PrintElem_sq(Lc);
	
		
}
void main()
{
	sqlist La,Lb,Lc;
	
	cout<<"创建两个非递减线性表：\n";
	create_sq(La);
	create_sq(Lb);
	MergeList(La,Lb);
	//PrintElem_sq(Lc);


}