链表删除重复数字求解 - 编程论坛

#2

D22845814702020-05-08 23:14

大佬们只需要教教我怎么删除，读入，输出我写

#3

fulltimelink2020-05-09 08:33

递归倒序处理 L* (L*, array[])

#4

D22845814702020-05-09 09:38

我……

#5

星泪成寒2020-05-09 10:57

程序代码：

#include <stdio.h>
#include <stdlib.h>

#define N 1000

typedef struct _node {
    int data;
    struct _node *next;
} node_t;

int main(int argc, const char * argv[])
{
    int i,num = 0;
    int input;
    int array[N] = {0}; //hash表
    node_t *L;
    node_t *head;

    //头指针（无数据）
    L = (node_t*)calloc(sizeof(node_t), 1);
    head = L;

    //获取输入个数
    scanf("%d", &num);

    //获取全部输入
    for (i = 0; i < num; ++i) {
        scanf("%d",&input);
        if (array[input] != 0) {//数据已存在，则不加入链表
            continue;
        }
        array[input] = 1;//hash表置位
        head->next = (node_t*)malloc(sizeof(node_t));
        head = head->next;
        head->data = input;
        head->next = NULL;
    }

    //输出
    head = L->next;
    while (head) {
        printf("%d ", head->data);
        head = head->next;
    }

    //释放内存
    while (L) {
        head = L;
        L = L->next;
        free(head);
    }

    return 0;
}

#6

D22845814702020-05-09 11:40

回复 5楼星泪成寒

非常感谢，你能帮我看看另一道题吗？在板块上面链表的删除那个

#7

fulltimelink2020-05-09 12:53

因为从你的样例输入和输出里，可以看出删除的重复元素为后保留，也就是重复的元素删除的是前面的，保留的是最后一个
所以用递归来倒序处理
当然也可以先翻转链表，去重，然后再翻转链表

程序代码：

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>

typedef struct _node {
    int data;
    struct _node *next;
} node_t;

node_t * removePreRepeatElement(node_t*, int [], int);

int main(int argc, const char * argv[]){
    int i, num = 0;
    int input;
    node_t *L;
    printf("初始化链表，请输入元素个数：\n");
    scanf("%d", &num);
    printf("请依次输入各个元素：\n");
    node_t *loop = (node_t*)malloc(sizeof(node_t));
    L = loop;
    for (i = 0; i < num; ++i) {
        scanf("%d", &input);
        node_t * innerLoop = loop;
        if (0 != i){
            innerLoop = (node_t*)malloc(sizeof(node_t));
            loop->next = innerLoop;
            loop = loop->next;
        }
        loop->data = input;
        loop->next = NULL;
    }
    int arr[1000] = { 0 };
    L = removePreRepeatElement(L, arr, num);

    //输出
    loop = L;
    while (loop) {
        printf("%d ", loop->data);
        loop = loop->next;
    }

    //释放内存
    while (L) {
        loop = L;
        L = L->next;
        free(loop);
    }

    return 0;
}

node_t * removePreRepeatElement(node_t* node, int *v, int total) {
    node_t * loop = NULL;
    if (NULL != node->next) {
        loop = removePreRepeatElement(node->next, v, total);
    }
    int isExist = 0;
    int j = 0;
    for (int i = 0; i < total; i++) {
        if (0 == *(v + i)) j = i;
        if (node->data == *(v + i)) {
            isExist = 1;
        }
    }
    if (!isExist) {
        *(v + j) = node->data;
        node->next = loop;
        return node;
    }
    else {
        free(node);
        return loop;
    }
}

初始化链表，请输入元素个数：
8
请依次输入各个元素：
7
6
6
7
8
9
10
11
6 7 8 9 10 11

#8

D22845814702020-05-09 14:01

回复 7楼 fulltimelink

谢谢，链表感觉自己很迷