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; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode headLeft = new ListNode(0);
        ListNode nextNode = headLeft;
        int sum = 0;
        while(l1 != null && l2 != null) {
            int tempSum = l1.val + l2.val + sum;
            ListNode node = new ListNode(tempSum % 10);
            sum = tempSum / 10;
            nextNode.next = node;
            l1 = l1.next;
            l2 = l2.next;
            nextNode = nextNode.next;
        }
        while (l1 != null) {
            int tempSum = l1.val + sum;
            ListNode node = new ListNode(tempSum % 10);
            sum = tempSum / 10;
            nextNode.next = node;
            l1 = l1.next;
            nextNode = nextNode.next;
        }
        while (l2 != null) {
            int tempSum = l2.val + sum;
            ListNode node = new ListNode(tempSum % 10);
            sum = tempSum / 10;
            nextNode.next = node;
            l2 = l2.next;
            nextNode = nextNode.next;
        }
        if (sum != 0) {
            nextNode.next = new ListNode(sum);
        }
        return headLeft.next;
    }
}