力扣 [02] [中等] [两链表的数值相加]

看懂题目很重要

2. 两数相加

难度中等6404收藏分享切换为英文接收动态反馈

给你两个 非空 的链表，表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的，并且每个节点只能存储 一位 数字。

请你将两个数相加，并以相同形式返回一个表示和的链表。

你可以假设除了数字 0 之外，这两个数都不会以 0 开头。

示例 1：

输入：l1 = [2,4,3], l2 = [5,6,4]
输出：[7,0,8]
解释：342 + 465 = 807.

示例 2：

输入：l1 = [0], l2 = [0]
输出：[0]

示例 3：

输入：l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
输出：[8,9,9,9,0,0,0,1]

提示：

• 每个链表中的节点数在范围 [1, 100] 内
• 0 <= Node.val <= 9
• 题目数据保证列表表示的数字不含前导零

---------------------------------------分割线----------------------------------

提交了三次

第一次代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    struct ListNode* p1 =  l1;
    struct ListNode* p2 =  l2;
    struct ListNode* l3;
    struct ListNode* p;
    struct ListNode* node;
    int jinwei = 0;
    int sum_each_time = 0;
    p = (struct ListNode* )malloc(sizeof(struct ListNode));
    l3 = p;
    while(1){
        if((p1==NULL)&&(p2!=NULL)){
            sum_each_time = p2->val + jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
            jinwei = sum_each_time/10;
            p2 = p2->next;           
        } else if((p1!=NULL)&&(p2==NULL)){
            sum_each_time = p1->val + jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
            jinwei = sum_each_time/10;
            p1 = p1->next;
        } else if((p1!=NULL)&&(p2!=NULL)){ 
            sum_each_time = p1->val + p2->val + jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
            jinwei = sum_each_time/10;
            p1 = p1->next;
            p2 = p2->next;
        } else if((p1==NULL)&&(p2==NULL)) {//这行判断条件有误，存在进位时仍需创建节点！！！
            break;
        }
    }
    return l3->next;
}

没有考虑到两指针为空但进位时仍需创建节点。

第二次，多增加一个条件分支，处理进位时需要多创建节点的情况，结果运行超时

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    struct ListNode* p1 =  l1;
    struct ListNode* p2 =  l2;
    struct ListNode* l3;
    struct ListNode* p;
    struct ListNode* node;
    int jinwei = 0;
    int sum_each_time = 0;
    p = (struct ListNode* )malloc(sizeof(struct ListNode));
    l3 = p;
    while(1){
        if((p1==NULL)&&(p2!=NULL)){
            sum_each_time = p2->val + jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
            jinwei = sum_each_time/10;
            p2 = p2->next;           
        } else if((p1!=NULL)&&(p2==NULL)){
            sum_each_time = p1->val + jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
            jinwei = sum_each_time/10;
            p1 = p1->next;
        } else if((p1!=NULL)&&(p2!=NULL)){
            sum_each_time = p1->val + p2->val + jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
            jinwei = sum_each_time/10;
            p1 = p1->next;
            p2 = p2->next;
        } else if((p1==NULL)&&(p2==NULL)&&(jinwei!=0)) {
            break;
        } else { //这是新增加的分支，处理双指针为空但有进位的情况
            sum_each_time += jinwei;
            node = (struct ListNode* )malloc(sizeof(struct ListNode));
            p->next= node;
            p = p->next;
            p->val = sum_each_time%10;
            p->next = NULL;
        }
    }
    return l3->next;
}

第三次，精简一下代码

通过每个链表指针根据自身是否为空，确定是否加上对应的值，简化代码

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
    struct ListNode* p1 =  l1;
    struct ListNode* p2 =  l2;
    struct ListNode* l3;
    struct ListNode* p;
    struct ListNode* node;
    int jinwei = 0;
    int sum_each_time = 0;
    p = (struct ListNode* )malloc(sizeof(struct ListNode));
    l3 = p;
    while((p1!=NULL)||(p2!=NULL)||(jinwei!=0)){
        sum_each_time =0;
        if(p1!=NULL){
            sum_each_time += p1->val;
            p1 = p1->next;
        }
        if(p2!=NULL){
            sum_each_time += p2->val;
            p2 = p2->next;            
        }
        sum_each_time+=jinwei;
        node = (struct ListNode* )malloc(sizeof(struct ListNode));
        p->next= node;
        p = p->next;
        p->val = sum_each_time%10;
        p->next = NULL;
        jinwei = sum_each_time/10;
   
    }
    return l3->next;
}

总结：

个人觉得难点由两个

一是创建节点之后怎么指向下一个不确定还没分配的节点，因此我弄了一个首节点是空数据的节点当链表头，所以返回值是l3->next ，而不是l3

二是进位处理