进阶实验2-3.3 两个有序链表序列的交集

已知两个非降序链表序列S1与S2，设计函数构造出S1与S2的交集新链表S3。

输入格式:

输入分两行，分别在每行给出由若干个正整数构成的非降序序列，用−1表示序列的结尾（−1不属于这个序列）。数字用空格间隔。

输出格式:

在一行中输出两个输入序列的交集序列，数字间用空格分开，结尾不能有多余空格；若新链表为空，输出NULL。

输入样例:

1 2 5 -1

2 4 5 8 10 -1

结尾无空行

输出样例:

2 5

结尾无空行

原代码

#include <stdio.h>
#include <stdlib.h>
struct node{
    int data;
    struct node *next;
};
struct node *MakeList(){
    struct node *head, *p, *tail;
    head = (struct node*) malloc(sizeof(struct node));
    tail = head;
    while (1){
        p = (struct node*) malloc(sizeof(struct node));
        scanf("%d", &p->data);
        if (p->data == -1) break;

        tail->next = p;
        tail = p;
    }
    tail->next = NULL;
    return head;
}

struct node *Combine(struct node *p1, struct node *p2){
    struct node *head, *p, *tail, *pp2;
    head = (struct node*) malloc(sizeof(struct node));
    tail = head;

    p1 = p1->next;
    while (p1){
        pp2 = p2->next;
        while (pp2){
            if(pp2->data == p1->data){
                p = (struct node*) malloc(sizeof(struct node));
                p->data = pp2->data;
                tail->next = p;
                tail = p;
            }
            pp2 = pp2->next;
        }
        p1 = p1->next;
    }
    tail->next = NULL;
    return head;
}

int main(){
    struct node *p1, *p2, *p;
    p1 = MakeList();
    p2 = MakeList();

    p = Combine(p1, p2);
    if(p->next == NULL ) printf("NULL");
    else{
        p = p->next;
        while (p){
            if(p->next == NULL) printf("%d", p->data);
            else printf("%d ", p->data);
            p = p->next;
        }
    }
    return 0;
}

原因：

使用了两重循环

修改后：

根据题目条件可知，两个链表的数据是由若干个正整数构成的非降序序列；由此条件修改代码，使用一次循环

#include <stdio.h>
#include <stdlib.h>
struct node{
    int data;
    struct node *next;
};
struct node *MakeList(){
    struct node *head, *p, *tail;
    head = (struct node*) malloc(sizeof(struct node));
    tail = head;
    while (1){
        p = (struct node*) malloc(sizeof(struct node));
        scanf("%d", &p->data);
        if (p->data == -1) break;

        tail->next = p;
        tail = p;
    }
    tail->next = NULL;
    return head;
}

struct node *Combine(struct node *p1, struct node *p2){
    struct node *head, *p, *tail, *pp2;
    head = (struct node*) malloc(sizeof(struct node));
    tail = head;

    p1 = p1->next;
    p2 = p2->next;
    while (p1 && p2){
        if(p1->data == p2->data){
            p = (struct node*) malloc(sizeof(struct node));
            p->data = p1->data;
            tail->next = p;
            tail = p;

            p1 = p1->next;
            p2 = p2->next;
        }else if(p1->data < p2->data){
            p1 = p1->next;
        }else{
            p2 = p2->next;
        }
    }
    tail->next = NULL;
    return head;
}

int main(){
    struct node *p1, *p2, *p;
    p1 = MakeList();
    p2 = MakeList();

    p = Combine(p1, p2);
    if(p->next == NULL ) printf("NULL");
    else{
        p = p->next;
        while (p){
            if(p->next == NULL) printf("%d", p->data);
            else printf("%d ", p->data);
            p = p->next;
        }
    }
    return 0;
}