C语言单链表两数之和以及删除倒数某个节点

Carrollovo

已于 2022-07-18 14:52:27 修改

阅读量165

点赞数 1

文章标签： c语言算法链表

于 2022-07-18 14:49:18 首次发布

本文链接：https://blog.csdn.net/weixin_44343334/article/details/125849700

版权

这段代码展示了如何实现两个链表相加以及删除链表底部节点的功能。首先，`intLink_add()`函数创建两个链表并相加，通过循环遍历每个节点，累加节点值并处理进位。最后，`delete_node()`函数接收一个链表和一个整数n，删除链表中的第n个节点。这两个函数都涉及到了链表的基本操作和指针的使用。

摘要由CSDN通过智能技术生成

int Link_add()
{
   listnode *num1;
   num1 = (listnode *)malloc(sizeof(listnode));
   num1->next =NULL;

   creat_list(num1);

   listnode *num2;
   num2 = (listnode *)malloc(sizeof(listnode));
   num2->next =NULL;

   creat_list(num2);

   listnode *sum, *tail;
   sum = (listnode *)malloc(sizeof(listnode));
   sum->next = NULL;
   tail = sum;

int carry = 0;

   while(num1 != NULL || num2 != NULL){
       listnode *new;
       new = (listnode *)malloc(sizeof(listnode));
       int i = (num1 != NULL)? num1->data : 0;
       int j = (num2 != NULL)? num2->data : 0;
       new->data = (carry + i + j) % 10;
       tail->next = new;
       new->next = NULL;
       tail = new;
       carry = (carry + i + j) / 10;

       if(num1 != NULL)
           num1 = num1->next;
       if(num2 != NULL)
           num2 = num2->next;
   }

   if(carry){
       listnode *new;
       new = (listnode *)malloc(sizeof(listnode));
       new->data = 1;
       tail->next = new;
       new->next = NULL;
       tail = new;
   }

Print_int(sum->next);
}

int delete_node()
{
   listnode *num1;
   num1 = (listnode *)malloc(sizeof(listnode));
   num1->next =NULL;

   creat_list(num1);

int n;

printf("delete bottom node is ");
scanf("%d", &n);

   listnode *p, *q;
   p = (listnode *)malloc(sizeof(listnode));
   p = num1;
   q = p;
   int i = 0;
   for(i; i <= n; i++){
       q = q->next;
   }

   while(q != NULL){
       p = p->next;
       q = q->next;
   }

p->next = p->next->next;

Print_int(num1);

}