LeetCode 2 Add Two Numbers

最新推荐文章于 2022-02-22 21:07:37 发布

lizhaowei213

最新推荐文章于 2022-02-22 21:07:37 发布

阅读量722

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/lizhaowei213/article/details/51025334

版权

LeetCode 专栏收录该内容

24 篇文章 0 订阅

订阅专栏

2. Add Two Numbers

My Submissions

Total Accepted: 132090 Total Submissions: 582867 Difficulty: Medium

You are given two linked lists representing two non-negative numbers. 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.

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

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

Have you met this question in a real interview?

Yes

Discuss

给出两个链表，求两个链表对应元素相加后得到的值。返回新链表的首地址。

看了网上别人的思路后，发现递归的方法做这道题真的好优雅。

/**
 * 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) 
    {
        return addTwoNumbers(l1,l2,0);
    }

    ListNode* addTwoNumbers(ListNode* l1,ListNode* l2,int cnt)
    {
        if(l1==NULL&& l2==NULL)
            return cnt==0?NULL:new ListNode(cnt);
        if(l1==NULL&&l2!=NULL)
            l1 = new ListNode(0);
        if(l2==NULL&&l1!=NULL)
            l2 = new ListNode(0);
        int sum=l1->val+l2->val+cnt;
        ListNode* curr=new ListNode(sum%10);
        curr->next=addTwoNumbers(l1->next,l2->next,sum/10);
        return curr;
    }
};