单链表的操作.cpp

单链表的操作 初始条件： 已知A

#include "stdafx.h"
#include <iostream>
using namespace std;

void main()
{
	cout<<"请您输入A链表的长度 :";
	int lengthOfA = -1;
	cin>>lengthOfA;
	if(cin.fail() || lengthOfA < 0){
		cout<<"error happen , try again:";
		cin.clear();
		cin.sync();
		cin>>lengthOfA;
	}
	Lnode *A = creatList(lengthOfA);
	cout<<"您输入的A表为：";
	printList(A);
	ordered_L(A);
	cout<<"非递减排序后的A表为：";
	printList(A);	
	cout<<"*****************************************************"<<endl;
   
	
	cout<<"请您输入B链表的长度 :";
	int lengthOfB = -1;
	cin>>lengthOfB;
	if(cin.fail() || lengthOfB < 0){
		cout<<"error happen , try again:";
	   cin.clear();
		cin.sync();
		cin>>lengthOfB;
	}
	Lnode *B = creatList(lengthOfB);
	cout<<"您输入的B表为：";
	printList(B);
	ordered_L(B);
	cout<<"非递减排序后的B表为：";
    printList(B);
    cout<<"*****************************************************"<<endl;
    
	
	cout<<"请您输入C链表的长度:";
	int lengthOfC = -1;
	cin>>lengthOfC;
	while(cin.fail() || lengthOfC < 0){
		cout<<"error happen , try again:";
		cin.clear();
		cin.sync();
		cin>>lengthOfC;
	};
	Lnode *C = creatList(lengthOfC);
	cout<<"您输入的C表为：";
	printList(C);
	ordered_L(C);
	cout<<"非递减排序后的C表为：";
	printList(C);
    cout<<"*****************************************************"<<endl;
	cout<<endl;
	Lnode *D = judgeExist(C,B);
	cout<<"B表和C表中相同的元素组成的D表为：";
	printList(D);
	cout<<"*****************************************************"<<endl;
	cout<<endl;
	Lnode *E = judgeExist(A,D);
    cout<<"A表中含有的既在B表中出现又在C表中出现的元素组成的E表为：";
	printList(E);
	DeleteTheSame(A, E);
	cout<<"*****************************************************"<<endl;
	cout<<endl;
    cout<<"在A表中删除E表后剩余元素为：";
	printList(A);
}