2. Add Two Number

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.

解题思路：
对两个链表同时进行遍历，循环结束条件为两个链表都到头，对于较短的链表，默认视为用0补齐。

个人代码：

    public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        boolean upper = false;
        ArrayList<Integer> arr = new ArrayList<>();
        while (l1 != null && l2 != null) {
            int sum = l1.val + l2.val;
            sum = upper ? sum + 1 : sum;
            if (sum > 9) {
                sum = sum % 10;
                upper = true;
            } else {
                upper = false;
            }
            arr.add(sum);
            l1 = l1.next;
            l2 = l2.next;
        }

        while (l1 != null) {
            int cv = upper ? l1.val + 1 : l1.val;
            if (cv > 9) {
                cv = cv % 10;
                upper = true;
            } else {
                upper = false;
            }
            arr.add(cv);
            l1 = l1.next;
        }

        while (l2 != null) {
            int cv = upper ? l2.val + 1 : l2.val;
            if (cv > 9) {
                cv = cv % 10;
                upper = true;
            } else {
                upper = false;
            }
            arr.add(cv);
            l2 = l2.next;
        }
        if (upper) {
            ListNode next = new ListNode(1);
            arr.add(1);
        }

        ListNode fl = null;
        for(int i=arr.size()-1;i>=0;i--){
            ListNode next = new ListNode(arr.get(i));
            next.next = fl;
            fl = next;
        }
        return fl;
    }

个人的代码是先把结果存到一个数组中，再遍历构造，效率较低，且代码量较多可读性一般。参考官网其它思路优化如下：

    public static ListNode addTwoNumbers2(ListNode l1, ListNode l2) {
        ListNode total = new ListNode(-1);
        ListNode cur1 = l1;
        ListNode cur2 = l2;
        ListNode cur = total;
        int carry = 0;
        while(cur1!=null || cur2!=null){
            int val1 = (cur1!=null)?cur1.val:0;
            int val2 = (cur2!=null)?cur2.val:0;
            int sum = val1+val2+carry;
            carry = sum/10;
            cur.next = new ListNode(sum%10);
            cur = cur.next;

            if(cur1 != null) cur1 = cur1.next;
            if(cur2 != null) cur2 = cur2.next;
        }
        if(carry!=0) cur.next = new ListNode(carry);
        return total.next;
    }

如上方法是完全秉承了一开始的解题思路，并做到了可读性良好。