LeetCode 第二题两数相加 C语言

最新推荐文章于 2025-06-10 09:50:10 发布

醉梦千秋

最新推荐文章于 2025-06-10 09:50:10 发布

阅读量1k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_36718417/article/details/85010097

本文详细解析了在C语言中实现两个链表数值相加的算法。通过定义链表结构体，采用指针操作，实现了链表的遍历、加法运算及进位处理。文章提供了完整的代码示例，展示了如何将链表转换为数值进行加法运算，并返回结果链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) 
{
    struct ListNode* top;
    struct ListNode* toptop;
    struct ListNode* end;
    struct ListNode* pl1;
    struct ListNode* pl2;
    int flag = 0;//进位标志
    int add;//相加之和
    
    //顶部初始化
    top = (struct ListNode*)malloc(sizeof(struct ListNode));
    end = top;
    top->val = 0;
    top->next = NULL;
    //搜寻指针指向两链表头节点
    pl1 = l1;
    pl2 = l2;
    
    while(pl1 || pl2)
    {
        //l1达到末尾
        if(pl1==NULL)
        {
            add = pl2->val;
        }
        //l2达到末尾
        else if(pl2==NULL)
        {
            add = pl1->val;
        }
        //都没达到末尾
        else if(pl1 != NULL && pl2 != NULL) 
        {
             add = pl1->val + pl2->val;
        }
        if(flag == 1)
        {
            add += flag;
            flag = 0;
        }
        
       
        if(add >= 10)
        {
            flag = 1;
            add = add%10;
        }
        toptop = top;
        top = (struct ListNode*)malloc(sizeof(struct ListNode));
        toptop->next = top;
        top->val = add;
        top->next = NULL;
        toptop = top;
        if(pl1 != NULL)
        {
            pl1 = pl1->next;
        }
        if(pl2 != NULL)
        {
            pl2 = pl2->next;
        }
        if(pl1 != NULL && pl2 == NULL && flag == 0)
        {
            top->next = pl1;
             return end->next;
        }
        if(pl2 != NULL && pl1 == NULL && flag == 0)
        {
            top->next = pl2;
             return end->next;
        }
        
    }
    if(flag == 1)
    {
        toptop = top;
        top = (struct ListNode*)malloc(sizeof(struct ListNode));
        toptop->next = top;
        top->val = flag;
        top->next = NULL;
        toptop = top;
    }
    return end->next;
}