# LeetCode 2. Add Two Numbers

### 问题描述

• 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.
• Example ：

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

### 问题分析

• 将链表相应位置相加，并注意进位问题即可

### 代码实现

/**
* Definition for singly-linked list.
* public class ListNode {
*     int val;
*     ListNode next;
*     ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if (l1 == null || l2 == null) {
return null;
}
ListNode cur1 = l1;
ListNode cur2 = l2;
ListNode dummy = new ListNode(0);
ListNode newTail = dummy;
int carry = 0;
//将两链对应元素带进位相加
while (cur1 != null || cur2 != null) {
int val = 0;
if (cur1 != null) {
val += cur1.val;
cur1 = cur1.next;
}
if (cur2 != null) {
val += cur2.val;
cur2 = cur2.next;
}
newTail.next = new ListNode((val + carry) % 10);
newTail = newTail.next;
//进位信息
carry = (val + carry) / 10;
}
//最终的进位信息
if (carry != 0) {
newTail.next = new ListNode(carry);
}
return dummy.next;
}
/*
while (cur1 != null && cur2 != null) {
int val = (cur1.val + cur2.val + carry) % 10;
newTail.next = new ListNode(val);
newTail = newTail.next;
carry = (cur1.val + cur2.val + carry) / 10;
cur1 = cur1.next;
cur2 = cur2.next;
}
while (cur1 != null) {
int val = (cur1.val + carry) % 10;
newTail.next = new ListNode(val);
newTail = newTail.next;
carry = (cur1.val + carry) / 10;
cur1 = cur1.next;
}
while (cur2 != null) {
int val = (cur2.val + carry) % 10;
newTail.next = new ListNode(val);
newTail = newTail.next;
carry = (cur2.val + carry) / 10;
cur2 = cur2.next;
}
if (carry != 0) {
newTail.next = new ListNode(carry);
}
return dummy.next;
}
*/
}