2. Add Two Numbers

最新推荐文章于 2024-09-07 18:44:11 发布

FreeeLinux

最新推荐文章于 2024-09-07 18:44:11 发布

阅读量434

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/FreeeLinux/article/details/64443975

版权

Leetcode 专栏收录该内容

64 篇文章 0 订阅

订阅专栏

 You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

第一次都错了题，以为链表大数字都是逆置的，耽误我半天时间。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if(l1 == NULL || l2 == NULL)
            return NULL;

        ListNode* p1 = l1;
        ListNode* p2 = l2;

        ListNode* head;
        ListNode** pp = &head;
        int carry = 0;
        while(p1 != NULL && p2 != NULL) {
            int num = p1->val + p2->val + carry;
            *pp = new ListNode(num % 10);
            pp = &((*pp)->next);
            carry = num / 10;
            p1 = p1->next;
            p2 = p2->next;
        }

        while(p1 != NULL) {
            int num = p1->val + carry;
            *pp = new ListNode(num % 10);
            pp = &((*pp)->next);
            carry = num / 10;
            p1 = p1->next;
        }
        while(p2 != NULL) {
            int num = p2->val + carry;
            *pp = new ListNode(num % 10);
            pp = &((*pp)->next);
            carry = num / 10;
            p2 = p2->next;
        }

        if(carry != 0) 
            *pp = new ListNode(carry);

        return head;
    }
};

the second clear solution:

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if(l1 == NULL || l2 == NULL)
            return NULL;

        ListNode* head;
        ListNode** pp = &head;
        int carry = 0;
        while(l1 != NULL || l2 != NULL || carry != 0) {
            int num = (l1 != NULL ? l1->val : 0) + (l2 != NULL ? l2->val : 0) + carry;
            *pp = new ListNode(num % 10);
            pp = &((*pp)->next);
            carry = num / 10;
            l1 = l1 != NULL ? l1->next : l1;
            l2 = l2 != NULL ? l2->next : l2;
        }
        return head;
    }
};