求序列的交集(链表)
问题描述 :
使用带头结点的单链表编程:
有两个序列,分别表示两个集合。
求它们的交集并输出。
输入说明 :
第一行输入序列A的信息:
第一个整数n(0<=n<=100),表示共有n个元素,其后有n个整数,表示n个元素的数据
第一行输入序列B的信息:
第一个整数n(0<=n<=100),表示共有n个元素,其后有n个整数,表示n个元素的数据
输出说明 :
输出交集的元素序列,输出格式见范例。
如果交集为空,则输出“head–>tail”
交集里的元素顺序,依照其在序列A中的顺序。
比如:
序列:
A:5 3 2 7
B:1 3 5 8
则交集为5和3,因为在序列A中,5在3的前面,所以在交集里5也在3的前面。
#include <iostream>
using namespace std;
struct student {
int num;
struct student* next;
};
student* creat(student *head, int n) {
// cout << "创建链表" << endl;
student *p, *q;
p = head;
q = head;
for (int j = 1; j <= n; j++) {
q = new student;
p->next = q;
p = q;
cin >> p->num;
}
q->next = NULL;
head->num = 1;
return head;
}
student* input(student* head, int n, int m) {
// cout << "插入节点" << endl;
head->num = 1;//num置1表状态正常,置0后返回invalid
student *p, *q;
student* mid = new student;
mid->num = n;
p = head;
q = p;
if (m == 1) {
//段首插入mid
if (head->next) {
mid->next = head->next;
head->next = mid;
}
else {
//仅有头节点
head->next = mid;
mid->next = NULL;
}
return head;
}
else {
for (int i = 1; i < m; i++) {
//插入段向后移动并判断是否为段尾
q = p;
if (p->next == NULL) {
head->num = 0;
//仅有头节点且不在首位插入num置0
return head;
}
p = p->next;
if (p->next == NULL) {
if (i < m - 1) {
//在段尾且还需移动num置0
head->num = 0;
return head;
}
else {
p->next = mid;
mid->next = NULL;
return head;
}
}
}
//中间插入mid
p = p->next;
q = q->next;
mid->next = q->next;
q->next = mid;
return head;
}
}
void del(student* head, int n) {
// cout << "删除节点" << endl;
head->num = 1;
student *p, *q;
p = head;
q = head;
for (int i = 0; i < n; i++) {
q = p;
p = p->next;
if (q->next == NULL) {
head->num = 0;
}
if (p->next == NULL) {
if (i < n - 1) {
head->num = 0;
}
else {
q->next = NULL;
delete p;
}
}
}
q->next = p->next;
delete p;
}
int find(student* head, int n) {
// cout << "寻找节点" << endl;
head->num = 1;
student* p = head;
int i = 0;
if (p->next == NULL) {
head->num = 0;
return i;
}
else {
while (p->next) {
p = p->next;
i += 1;
if (p->num == n) {
return i;
}
if (p->next == NULL) {
head->num = 0;
return i;
}
}
}
head->num = 0;
return i;
}
void show(student* head) {
// cout << "展示链表" << endl;
cout << "head-->";
student *p = head;
while (p->next != NULL) {
p = p->next;
cout << p->num << "-->";
}
cout << "tail" << endl;
}
//head中值作为链表状态表示,实际使用中不对head做实际操作与显示
int main() {
student* a = new student;
student* b = new student;
student* c = new student;
student* p, *q;
int m, n, i, j;
cin >> i;
a = creat(a, i);
cin >> j;
b = creat(b, j);
c = creat(c, 0);
p = a;
m = 1;
while (p->next!=NULL) {
p = p->next;
j = find(b, p->num);
if (b->num != 0) {
c = input(c, p->num, m);
m+=1;
}
}
show(c);
return 0;
}