# [leetcode] 【链表】2. Add Two Numbers

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

# 题解

/**
* 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;
else if(l1==NULL&&l2!=NULL)
return l2;
else if(l1!=NULL&&l2==NULL)
return l1;
ListNode* l=new ListNode(0);
ListNode* temp=l;
int jw=0;
while(l1!=NULL||l2!=NULL)
{
int val1=0;
if(l1!=NULL)
{
val1=l1->val;
l1=l1->next;
}
int val2=0;
if(l2!=NULL)
{
val2=l2->val;
l2=l2->next;
}
int t=val1+val2+jw;
temp->val=t%10;
jw=t/10;
if(l1!=NULL||l2!=NULL||t>=10)
temp->next=new ListNode(jw);
temp=temp->next;
}
return l;
}
};

• 本文已收录于以下专栏：

## 【LeetCode】2.Add Two Numbers两个单链表相加

You are given two non-empty linked lists（非空链表） representing two non-negative integers（非负整数）. The dig...

## [C++]LeetCode 2: Add Two Numbers（链表逆序加法）

Problem: You are given two linked lists representing two non-negative numbers. The digits are stored...

## LeetCode 445. Add Two Numbers II--两个链表均按照由尾部到头部计算两个结点数值之和，保持进位

You are given two non-empty linked lists representing two non-negative integers. The most significan...

## leetcode： 单链表之Add Two Numbers

leetcode： 单链表之Add Two Numbers 题目：You are given two linked lists representing two non-negative num...

## LeetCode 445 Add Two Numbers II（栈+链表）

You are given two non-empty linked lists representing two non-negative integers. The most significan...

## [Leetcode]Add Two Numbers 链表实现大数字相加

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)