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) {
        
        int carry;
        ListNode i = l1;
        ListNode j = l2;
        
        int num1 = i.val;
        int num2 = j.val;
        ListNode head = new ListNode((num1 + num2)%10);
        ListNode newNode = head;
        carry = (num1 + num2)/10;
        
        while (i != null || j != null){  
            i = (i != null)?i.next:null;
            j = (j != null)?j.next:null;
            if( carry == 0 && i == null && j == null)
                return head;
            num1 = (i != null)?i.val:0;
            num2 = (j != null)?j.val:0;
            int sum = (num1 + num2 + carry)%10;
            carry = (num1 + num2 + carry)/10;
            newNode.next = new ListNode(sum);
            newNode = newNode.next;
                  
        }
        return head;
    }
}

测试：Runtime: 20 ms, faster than 99.48% of Java online submissions for Add Two Numbers.

本题主要是carry在大于0，而遍历到两个node都已经为空时，需要添加进位值node这一步容易忽略。
比如：
input: [5]
[5]
output：[0,1]
如果忽略这种情况，output就变成 [0]。

附本题官方答案，来自leetcode：

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode dummyHead = new ListNode(0);
    ListNode p = l1, q = l2, curr = dummyHead;
    int carry = 0;
    while (p != null || q != null) {
        int x = (p != null) ? p.val : 0;
        int y = (q != null) ? q.val : 0;
        int sum = carry + x + y;
        carry = sum / 10;
        curr.next = new ListNode(sum % 10);
        curr = curr.next;
        if (p != null) p = p.next;
        if (q != null) q = q.next;
    }
    if (carry > 0) {
        curr.next = new ListNode(carry);
    }
    return dummyHead.next;
}

官方使用dummyhead指向新的链表头部，这样就把第一步创建输出链表的头部也写进了循环，缩短了代码量。