# 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.

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if (l1 == null) return l2;
if (l2 == null) return l1;
ListNode dummy = new ListNode(-1), cur = dummy;
int carry = 0, sum = 0;
while (l1 != null || l2 != null) {
int num1 = l1 == null ? 0 : l1.val;
int num2 = l2 == null ? 0 : l2.val;
sum = num1 + num2 + carry;
ListNode temp = new ListNode(sum % 10);
carry = sum / 10;
cur.next = temp;
cur = temp;
if (l1 != null) l1 = l1.next;
if (l2 != null) l2 = l2.next;
}
if (carry != 0) {
cur.next = new ListNode(1);
}
return dummy.next;
}
• 本文已收录于以下专栏：

举报原因： 您举报文章：LeetCode 2. Add Two Numbers 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)