两个有序链表序列的交集
已知两个非降序链表序列S1与S2,设计函数构造出S1与S2的交集新链表S3。
输入格式:
输入分两行,分别在每行给出由若干个正整数构成的非降序序列,用−1表示序列的结尾(−1不属于这个序列)。数字用空格间隔。
输出格式:
在一行中输出两个输入序列的交集序列,数字间用空格分开,结尾不能有多余空格;若新链表为空,输出NULL
。
输入样例:
1 2 5 -1
2 4 5 8 10 -1
输出样例:
2 5
标程
#include<map>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<vector>
#include<iomanip>
#include<cstring>
#include<iterator>
#include<iostream>
#include<algorithm>
#define R register
#define LL long long
#define pi 3.141
#define INF 1400000000
using namespace std;
//两题写法几乎完全相同
struct Node{
int number;
Node* next;
};
inline int read() {
int number = 0;
int f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') {
f = -1;
}
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
number = number * 10 + ch - '0', ch = getchar();
}
return number * f;
}
int main(){
Node* List1 = (Node*)malloc(sizeof(Node));
List1->next = NULL;
Node* List2 = (Node*)malloc(sizeof(Node));
List2->next = NULL;
Node* List3 = (Node*)malloc(sizeof(Node));
List3->next = NULL;
Node *point = (Node*)malloc(sizeof(Node));
int number = read();
point = List1;
while (number != -1) {
Node *temp = (Node*)malloc(sizeof(Node));
temp->number = number;
temp->next = NULL;
point->next = temp;
//point = temp;
memcpy(&point, &temp, sizeof(temp));
number = read();
}
point = List2;
number = read();
while (number != -1) {
Node *temp = (Node*)malloc(sizeof(Node));
temp->number = number;
temp->next = NULL;
point->next = temp;
point = temp;
number = read();
}
Node *point1, *point2, *point3;
point3 = List3;
point1 = List1->next, point2 = List2->next;
while (point1 != NULL && point2 != NULL) {
if (point1->number == point2->number) {
point3->next = point1;
point3 = point1;
point1 = point1->next;
point2 = point2->next;
}
else if (point1->number < point2->number) {
point1 = point1->next;
}
else {
point2 = point2->next;
}
}
point = List3->next;
if (point == NULL) {
printf("NULL");
}
else {
bool flag = false;
while (point != NULL) {
if (flag == false) {
flag = !flag;
}
else {
printf(" ");
}
printf("%d", point->number);
point = point->next;
}
}
return 0;
}