答疑解惑必采纳 2021-08-02 17:04 采纳率: 91.3%
浏览 52
已结题

c语言 删除链表中第一个包含值的元素,补全一下我的这个代码

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

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

struct node *delete_contains(int value, struct node *head);
struct node *strings_to_list(int len, char *strings[]);
void print_list(struct node *head);

// DO NOT CHANGE THIS MAIN FUNCTION

int main(int argc, char *argv[]) {
int value;
scanf("%d", &value);
// create linked list from command line arguments
struct node *head = strings_to_list(argc - 1, &argv[1]);

struct node *new_head = delete_contains(value, head);
print_list(new_head);

return 0;

}

//
// Delete the first node in the list containing the value value.
// The deleted node is freed.
// If no node contains value, the list is not changed.
// The head of the list is returned.
//
struct node *delete_contains(int value, struct node *head) {

// PUT YOUR CODE HERE (change the next line!)
return NULL;

}

// DO NOT CHANGE THIS FUNCTION
// create linked list from array of strings
struct node *strings_to_list(int len, char *strings[]) {
struct node *head = NULL;
int i = len - 1;
while (i >= 0) {
struct node *n = malloc(sizeof (struct node));
assert(n != NULL);
n->next = head;
n->data = atoi(strings[i]);
head = n;
i -= 1;
}
return head;
}

// DO NOT CHANGE THIS FUNCTION
// print linked list
void print_list(struct node *head) {
printf("[");
struct node *n = head;
while (n != NULL) {
// If you're getting an error here,
// you have returned an invalid list
printf("%d", n->data);
if (n->next != NULL) {
printf(", ");
}
n = n->next;
}
printf("]\n");
}

  • 写回答

2条回答 默认 最新

  • CSDN专家-link 2021-08-02 18:11
    关注
    struct node *delete_contains(int value, struct node *head) 
    {
        if(head == NULL)
          return head;
        struct node *p = head;
        if(p->data == value)
            return p->next;
        struct node *q = p;
        p = p->next;
        while(p != NULL)
        {
              if(p->data == value)
              {
                  q->next = p->next;
                  break;
              }
              q = p;
              p = p->next;
        }
        return head;
    }
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(1条)

报告相同问题?

问题事件

  • 系统已结题 8月10日
  • 已采纳回答 8月2日
  • 创建了问题 8月2日

悬赏问题

  • ¥15 FPGA-SRIO初始化失败
  • ¥15 MapReduce实现倒排索引失败
  • ¥15 luckysheet
  • ¥15 ZABBIX6.0L连接数据库报错,如何解决?(操作系统-centos)
  • ¥15 找一位技术过硬的游戏pj程序员
  • ¥15 matlab生成电测深三层曲线模型代码
  • ¥50 随机森林与房贷信用风险模型
  • ¥50 buildozer打包kivy app失败
  • ¥30 在vs2022里运行python代码
  • ¥15 不同尺寸货物如何寻找合适的包装箱型谱