LeetCode - Add Two Numbers - Frequent

https://leetcode.com/problems/add-two-numbers/

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

这道题还是比较简单的，因为list本来就是reverse order的，所以直接每个node挨个加就行了。

需要注意的还是进位问题，尤其是最后，如果还有进位的话，就需要新增一个node，相当于高位增加了一位。

把结果直接保存到原有的list上，如果一个list加完了，另一个list还有Node的话，就把剩余部分和结果List连接起来继续加。因为没有用额外空间，所以空间复杂度O(1)，时间复杂度O(n)

代码如下：

    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if(l1==null) return l2;
        if(l2==null) return l1;
        ListNode t1 = l1;
        ListNode t2 = l2;
        ListNode prev = l1;
        int carry = 0;
        while(t1!=null && t2 !=null){
            int val = t1.val+t2.val + carry;
            t1.val = val%10;
            carry = val/10;
            prev = t1;
            t1 = t1.next;
            t2 = t2.next;
        }
        if(t2!=null) prev.next = t2;
        t2 = prev.next;
        while(t2!=null && carry!=0){
            int val = t2.val + carry;
            t2.val = val%10;
            carry = val/10;
            prev = t2;
            t2 = t2.next;
        }
        if(carry!=0){
            ListNode last = new ListNode(carry);
            prev.next = last;
        }
        return l1;
    }