数据结构上机测试2-2:单链表操作B

数据结构上机测试2-2:单链表操作B

Time Limit: 1000 ms Memory Limit: 65536 KiB

Problem Description

按照数据输入的相反顺序（逆位序）建立一个单链表，并将单链表中重复的元素删除（值相同的元素只保留最后输入的一个）。

Input

第一行输入元素个数n；
第二行输入n个整数。

Output

第一行输出初始链表元素个数；
第二行输出按照逆位序所建立的初始链表；
第三行输出删除重复元素后的单链表元素个数；
第四行输出删除重复元素后的单链表。

Sample Input

10
21 30 14 55 32 63 11 30 55 30

Sample Output

10
30 55 30 11 63 32 55 14 30 21
7
30 55 11 63 32 14 21

Hint

Source

#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
struct node{
    int date;
    struct node *next;
};
struct node* creat(struct node *head, int n){
    struct node *p;
    head = (struct node*)malloc(sizeof(struct node));
    head -> next = NULL;
    //tail = head;
    for(int i = 1; i <= n; i++){
        p = (struct node *)malloc(sizeof(struct node));
        scanf("%d", &p -> date);
        p -> next = NULL;
        p -> next = head -> next;
        head -> next = p;
    }
    return head;
}
int delete_x(struct node *head){
    struct node *p, *q, *t;
    int sum = 0;
    t = head -> next;
    while(t){
        p = t;
        q = p -> next;
        while(q){
            if(q -> date == t ->date){
                p -> next = q -> next;
                q = q-> next;
                sum++;
            }
            else{
                p = p -> next;
                q = p -> next;
            }

        }
        t = t ->next;
    }
    return sum;
}
int main(){
    int n, sum;
    struct node *head, *p;
    head = (struct node *)malloc(sizeof(struct node));
    scanf("%d", &n);
    head = creat(head, n);
    //cin>>m;
    p = head -> next;
    printf("%d\n", n);
    while(p){
        if(p == head -> next){
            printf("%d", p -> date);
        }
        else printf(" %d", p -> date);
        p = p -> next;
    }
    printf("\n");
    sum = n - delete_x(head);
    printf("%d\n", sum);
    p = head -> next;
    while(p){
        if(p == head -> next){
            printf("%d", p -> date);
        }
        else printf(" %d", p -> date);
        p = p -> next;
    }
    printf("\n");
    return 0;
}