LeetCode 刷题之路 Add Two Numbers

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

很显然这题需要多加一个carry来判断是否需要进位。然后对呀俩个linked lists 长度匹配问题上，我们可以设定一旦没有next的时候值为0。

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode prev = new ListNode(0);
        ListNode head = prev;
        int carry = 0;
        while(l1 != null || l2 != null){
            int x = (l1 == null) ? 0 : l1.val;
            int y = (l2 == null) ? 0 : l2.val;
            int sum = x + y + carry;
            ListNode cur = new ListNode(sum % 10);
            carry = sum / 10;
            prev.next = cur;
            prev = cur;
            if(l1!=null) l1 = l1.next;
            if(l2!=null) l2 = l2.next;
        }
        if(carry > 0){
            prev.next = new ListNode(1);
        }
        return head.next;
    }
}