两数之和 （Add Tow Numbers）__by leetCode

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.
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution{
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    }
}

解析:
通过链式列表进行存储，最后返回的也是一个链式列表，那么就可以直接按每个节点进行处理，每个节点进行Add操作，这时候我们还应该设置一个标志位，用以标识是否有进位需要。

• One

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        //传入l3,ln,一个作为结果返回，一个来标识对应的
        return calc(l1 , l2 , new ListNode(0),new ListNode(0));
    }

    public ListNode calc(ListNode l1, ListNode l2, ListNode l3, ListNode ln){
        //循环l1,l2
        if (l1 != null || l2!= null || (l3!= null && l3.val>0)){
            if(l1 == null){
                l1 = new ListNode(0);
            }
            int n = l2 == null?0:l2.val;
            int sum = l1.val+n+l3.val;
            l3 = new ListNode(sum/10);
            l1.val = sum%10;
            ListNode lm = new ListNode(l1.val);
            ln.next = lm;
            l1 = l1 == null?null:l1.next==null?null:l1.next;
            l2 = l2 == null?null:l2.next==null?null:l2.next;
            calc(l1,l2,l3,lm);
        }
        return ln.next;
    }

解析:
通过一个链表L3进行进位标识，然后加到下一个节点上。因为最开始的节点的一个无用节点，所以最后返回Ln的next就ok了。

• Two

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

原理一样。

时间复杂度 O(n)
空间复杂度O(n)