leetcode - Add tow numbers - Java

题目描述：给两个非空的List，将两个list的值相加，返回结果list。

思路：该链表的前面部分就是数值的低位，所以依次读取链表中的数值就OK了，要考虑到相加大于10的情况。我自己写的solution有点复杂：

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode ans = new ListNode(-1);
        ListNode index = ans;
        int jump = 0;
        while (l1 != null && l2 != null){
            index.next = new ListNode((l1.val + l2.val + jump) % 10);
            index = index.next;
            jump = (l1.val + l2.val + jump) / 10;
            l1 = l1.next;
            l2 = l2.next;
        }
        if(l1 == null){
            while(l2 != null){
                index.next = new ListNode((l2.val + jump) % 10);
                jump = (l2.val + jump) / 10;
                index = index.next;
                l2 = l2.next;
            }
        }else if(l2 == null){
            while(l1 != null){
                index.next = new ListNode((l1.val + jump) % 10);
                jump = (l1.val + jump) / 10;
                index = index.next;
                l1 = l1.next;
            }
        }
        if(jump > 0)index.next = new ListNode(jump);
        return ans.next;
    }

我自己的solution就是先把两个List都有的位数先加起来，再加还有的那个list。看了官方给的solution后觉得自己的代码有些冗余了，不太美观。下面贴上官方代码：

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