[LeetCode]Add Two Numbers(Java)

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)

Output: 7 -> 0 -> 8

题意：给两个非负数的反序单链表，要求相加后以单链表的形式返回。

看似很简单的一道题，但是需要注意的地方比较多：

1.相加要注意当前总和是否超过十，超过十要记得在下一位加一

2.两个链表长度不一

自我认为比较精简的AC代码

/**
 * 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) {
        if(l1 == null) return l2;
        if(l2 == null) return l1;
        
        int sum = 0;
        
        ListNode head = new ListNode(-1);
        ListNode l3 = head;
        while(l1 != null || l2 != null){
            if(l1 != null){
                sum += l1.val;
                l1 = l1.next;
            }
            if(l2 != null){
                sum += l2.val;
                l2 = l2.next;
            }
            l3.next = new ListNode(sum%10);
            sum = sum/10;
            l3 = l3.next;
        }
        if(sum!=0){
            l3.next = new ListNode(sum);
        }
        return head.next;
    }
}