链表删除问题，与常规删除节点不同

2017-07-31 04:48:25 163 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

VS2022+Qt6保姆级环境配置指南：从插件安装到项目互通全流程本文提供VS2022与Qt6深度整合的全流程指南，涵盖环境配置、插件安装、项目互通等关键步骤。详细解析编译器版本匹配、跨IDE协作方案及效能优化技巧，帮助开发者高效搭建C++界面设计开发环境，实现软件项目无缝互通。阅读详情

删除要求：输入一个数字，查找所有此数字的节点全部删
我只能做到删除头，中间，末尾节点，单一的，如果有两个数是放在一起就会出现bug，甚至假如是3个数一起放在中间或者末尾又该怎么办。

void delet(int disnum,n *head) {
n t,q,p;
t=*head;
while(t) {
if(t->data==disnum) {
if(t==*head) {
*head=(*head)->next;

free(t);

} else if(t->next==NULL) {
q->next=NULL;
free(t);

} else { //bug everywhere
q->next=t->next;

free(t);
}
}
}
q=t;
t=t->next;
} //怎么把这个代码改造成我想要的，，，求助啊，，，，又没有逻辑了，，

...全文

DC综合中set_dft_signal的实战配置与优化策略本文深入解析了DC综合中set_dft_signal命令的实战配置与优化策略。文章从命令的核心作用出发，详细拆解了-view、-type、-usage等关键参数，并通过扫描使能与时钟门控的实战案例，展示了如何正确配置以实现测试模式下的功耗优化。同时，文章总结了高级优化策略、与低功耗流程的协同方法以及常见错误排查清单，旨在帮助数字芯片设计工程师构建高可测性、低功耗的稳健DFT基础。阅读详情

跃2.0

C语言 70,039 成员 243,237 内容

+ 关注 + 加入社区

切换为时间正序

跃2.0 2017-07-31

打赏
举报

引用 2 楼 cfjtaishan 的回复:

void delet(int disnum, n *head)
{
    n p, q;

    p = q = *head;
    while (p) {
        if (p->data == disnum) {
            if (p == *head) {
                *head = (*head)->next;
                free(p);
                p = q = *head;
                continue;
            } else {
                q->next = p->next;
                free(p);
                p = q;
                p = p->next;
                continue;
            }
        }
        q = p;
        p = p->next;
    }
}

试一下这个版本。以下是我的测试代码：

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

typedef struct node {
    int data;
    struct node *next;
}*n;


n create_link(int num)
{
    int i;
    n p, q, phead = NULL;

    for (i = 0; i < num; i++) {
        p = (n)malloc(sizeof (struct node));
        if (!p) {
            fprintf(stderr, "malloc error!\n");
            exit(-1);
        }
        scanf("%d", &p->data);

        if (!phead) {
            phead = p;
            q = p;
        } else {
            q->next = p;
            q = p;
        }
    }
    q->next = NULL;

    return phead;
}

void print_link(n phead)
{
    n p = phead;

    while (p) {
        printf("%d\t", p->data);
        p = p->next;
    }
    putchar(10);
}

void delet(int disnum, n *head)
{
    n p, q;

    p = q = *head;
    while (p) {
        if (p->data == disnum) {
            if (p == *head) {
                *head = (*head)->next;
                free(p);
                p = q = *head;
                continue;
            } else {
                q->next = p->next;
                free(p);
                p = q;
                p = p->next;
                continue;
            }
        }
        q = p;
        p = p->next;
    }
}

int main(void)
{
    int num;
    n head;

    scanf("%d", &num);
    head = create_link(num);
    print_link(head);

    scanf("%d", &num);
    delet(num, &head);
    print_link(head);
    return 0;
}

你好棒棒啊，我去思考下你代码了，

跃2.0 2017-07-31

打赏
举报

引用 2 楼 cfjtaishan 的回复:

void delet(int disnum, n *head)
{
    n p, q;

    p = q = *head;
    while (p) {
        if (p->data == disnum) {
            if (p == *head) {
                *head = (*head)->next;
                free(p);
                p = q = *head;
                continue;
            } else {
                q->next = p->next;
                free(p);
                p = q;
                p = p->next;
                continue;
            }
        }
        q = p;
        p = p->next;
    }
}

试一下这个版本。以下是我的测试代码：

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

typedef struct node {
    int data;
    struct node *next;
}*n;


n create_link(int num)
{
    int i;
    n p, q, phead = NULL;

    for (i = 0; i < num; i++) {
        p = (n)malloc(sizeof (struct node));
        if (!p) {
            fprintf(stderr, "malloc error!\n");
            exit(-1);
        }
        scanf("%d", &p->data);

        if (!phead) {
            phead = p;
            q = p;
        } else {
            q->next = p;
            q = p;
        }
    }
    q->next = NULL;

    return phead;
}

void print_link(n phead)
{
    n p = phead;

    while (p) {
        printf("%d\t", p->data);
        p = p->next;
    }
    putchar(10);
}

void delet(int disnum, n *head)
{
    n p, q;

    p = q = *head;
    while (p) {
        if (p->data == disnum) {
            if (p == *head) {
                *head = (*head)->next;
                free(p);
                p = q = *head;
                continue;
            } else {
                q->next = p->next;
                free(p);
                p = q;
                p = p->next;
                continue;
            }
        }
        q = p;
        p = p->next;
    }
}

int main(void)
{
    int num;
    n head;

    scanf("%d", &num);
    head = create_link(num);
    print_link(head);

    scanf("%d", &num);
    delet(num, &head);
    print_link(head);
    return 0;
}

谢谢

自信男孩 2017-07-31

打赏
举报

void delet(int disnum, n *head)
{
    n p, q;

    p = q = *head;
    while (p) {
        if (p->data == disnum) {
            if (p == *head) {
                *head = (*head)->next;
                free(p);
                p = q = *head;
                continue;
            } else {
                q->next = p->next;
                free(p);
                p = q;
                p = p->next;
                continue;
            }
        }
        q = p;
        p = p->next;
    }
}

试一下这个版本。以下是我的测试代码：

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

typedef struct node {
    int data;
    struct node *next;
}*n;


n create_link(int num)
{
    int i;
    n p, q, phead = NULL;

    for (i = 0; i < num; i++) {
        p = (n)malloc(sizeof (struct node));
        if (!p) {
            fprintf(stderr, "malloc error!\n");
            exit(-1);
        }
        scanf("%d", &p->data);

        if (!phead) {
            phead = p;
            q = p;
        } else {
            q->next = p;
            q = p;
        }
    }
    q->next = NULL;

    return phead;
}

void print_link(n phead)
{
    n p = phead;

    while (p) {
        printf("%d\t", p->data);
        p = p->next;
    }
    putchar(10);
}

void delet(int disnum, n *head)
{
    n p, q;

    p = q = *head;
    while (p) {
        if (p->data == disnum) {
            if (p == *head) {
                *head = (*head)->next;
                free(p);
                p = q = *head;
                continue;
            } else {
                q->next = p->next;
                free(p);
                p = q;
                p = p->next;
                continue;
            }
        }
        q = p;
        p = p->next;
    }
}

int main(void)
{
    int num;
    n head;

    scanf("%d", &num);
    head = create_link(num);
    print_link(head);

    scanf("%d", &num);
    delet(num, &head);
    print_link(head);
    return 0;
}

赵4老师 2017-07-31

打赏
举报

数据结构对单链表进行数据排序 http://bbs.csdn.net/topics/392201633

链表删除问题，与常规删除节点不同

相关推荐