数据结构实现(C++):链表程序完成两个集合的交集

题目:
实现一个链表的程序,能够完成两个集合的交
输入:第一行为集合A,第二行为集合B
输出:A交B

#include<iostream>
using namespace std;

typedef int ElemType;
struct Node
{
	ElemType data;
	Node* next;
};

class LinkList
{
private:
	Node* Head;
public:
	LinkList()
	{
		Head = new Node;
		Head->next = NULL;
	}
	~LinkList()
	{
		Node* q;
		Node* p = Head;
		while (p)
		{
			q = p->next;
			delete p;
			p = q;
		}
	}
	void CreateList1(int n)
	{
		Node* p, * s;
		p = Head;
		cout << "Please input " << n << " data:" << endl;
		for (int i = 0; i != n; ++i)
		{
			s = new Node;
			cin >> s->data;
			s->next = p->next;
			p->next = s;
		}
	}
	void CreateList2(int n)
	{
		Node* p, * s;
		p = Head;
		cout << "Please input " << n << " data:" << endl;
		for (int i = 0; i != n; ++i)
		{
			s = new Node;
			cin >> s->data;
			p->next = s;
			p = s;
		}
		p->next = NULL;
	}
	ElemType GetElem(int i)
	{
		Node* p = Head->next;
		int j = 0;
		while (p && j < i)
		{
			p = p->next;
			++j;
		}
		if (!p || j > i)
		{
			cout << "location error";
			return -1;
		}
		else
			return p->data;
	}
	int ListLength()
	{
		if (Head->next = NULL)
			return 0;
		int i = 0;
		Node* p = Head->next;
		while (p != NULL)
		{
			++i;
			p = p->next;
		}

		return i;
	}
};

int main()
{
	LinkList li, lj, ls;
	int n1, n2;

	cout << "input number of set_one:";
	cin >> n1;
	li.CreateList2(n1);

	cout << "input number of set_two:";
	cin >> n2;
	lj.CreateList2(n2);

	cout << "The same number:";
	for (int i = 0; i != n1; ++i)
	{
		for (int j = 0; j != n2; ++j)
		{
			if (li.GetElem(i) == lj.GetElem(j))
				cout << li.GetElem(i) << ' ';
		}
	}
		
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值