add two numbers

最新推荐文章于 2021-02-19 08:37:33 发布

wishingweed

最新推荐文章于 2021-02-19 08:37:33 发布

阅读量363

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u010484308/article/details/41212097

版权

leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

for save space, I write a really ugly code here.

/**
 * 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)
        return l2;
    if(l2 == NULL)
        return l1;
    ListNode * head1 = l1;
    int carry = 0;
    while(l1->next!= NULL && l2->next!= NULL)
    {
        int temp = l1->val + l2->val + carry;
        carry = temp/10;
        l1->val = temp%10;
        l1 = l1->next;
        l2 = l2->next;
    }
    while(1)
    {
    if(l1->next != NULL && l2->next == NULL)
    {
        int temp = l1->val + l2->val +carry;
        carry = temp/10;
        l1->val = temp%10;
        l1 = l1->next;
        break;
    }
    if(l1->next == NULL&& l2->next!= NULL)
    {
        int temp = l1->val + l2->val +carry;
        carry = temp/10;
        l1->val = temp%10;
        l1->next = l2->next;
        l1 = l1->next;
        break;
    }
    if(l1->next == NULL && l2->next == NULL)
    {
        l1->val = l1->val + l2->val;
        break;
    }
    }
    
     while(l1->next!= NULL)
        {
            int temp = l1->val + carry;
            carry = temp/10;
            l1->val = temp%10;
            l1 = l1->next;
        }
    int temp = l1->val + carry;
    l1->val = temp%10;
    carry = temp/10;
    if(carry)
    {
        ListNode *l3 = new ListNode(1);
        l1->next = l3;
    }
    return head1;    
    }
};