鏈表表示的兩數相加

給定兩個非空鏈表來表示兩個非負整數。位數按照逆序方式存儲，它們的每個節點只存儲單個數字。將兩數相加返回一個新的鏈表。你可以假設除了數字 0 之外，這兩個數字都不會以零開頭。

示例：

輸入：(2 -> 4 -> 3) + (5 -> 6 -> 4)

輸出：7 -> 0 -> 8

原因：342 + 465 = 807

代碼一：

    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode result = new ListNode(0);
        ListNode first = l1, second = l2, tmpNode = result;
        int tmp = 0;
        
        while(first != null || second != null){
            int firstValue ,secondValue;
            if(first == null){firstValue = 0;}
            else{firstValue = first.val;}
            
            if(second == null){secondValue = 0;}
            else{secondValue = second.val;}
            
            tmp = tmp + firstValue + secondValue;
            tmpNode.next = new ListNode(tmp % 10);
            tmp = tmp / 10;
            
            tmpNode = tmpNode.next;
            if(first != null){first = first.next;}
            if(second != null){second = second.next;}
        }
        if(tmp != 0){
            tmpNode.next = new ListNode(tmp % 10);
        }
        return result.next;
    }

代碼二：

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;
}