2. Add Two Numbers

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) {
        ListNode list = null;
        ListNode next = null;
        list = new ListNode((l1.val+l2.val)%10);
        next = list;
        int c=(l1.val+l2.val)/10;
        l1=l1.next;
        l2=l2.next;
        
        while(l1 !=null &&l2!= null){
          
            ListNode nextt = new ListNode((l1.val+l2.val+c)%10);
            next.next = nextt;
            c=(l1.val+l2.val+c)/10;
             l1=l1.next;
             l2=l2.next;
            next = next.next;
        }
        ListNode temp=((l1!=null||l2!=null)?((l1!=null)?l1:l2):null);
        while(c !=0 ||temp!=null){
            int val =0;
            if(temp!=null){
                val =temp.val;
                temp = temp.next;
            } 
            next.next = new ListNode((c+val)%10);
            c=(c+val)/10;
            next=next.next;
        }
        return list;
    }
}

方法二：采用递归方式：

/**
     * 递归方式 -- 56ms
     * 
     * @param l1
     * @param l2
     * @return
     */
    public ListNode addTwoNumbers2(ListNode l1, ListNode l2) {
        if (l1 == null || l2 == null) {
            return l1 == null ? l2 : l1;
        }
        int value = l1.val + l2.val;
        ListNode result = new ListNode(value % 10);
        result.next = addTwoNumbers2(l1.next, l2.next);
        if (value >= 10) {
            result.next = addTwoNumbers2(new ListNode(value / 10), result.next);
        }
        return result;
    }

方法3：遍历

/**
     * 57ms <br />
     * 将个数较少的列表后面补上0
     * 
     * @param l1
     * @param l2
     * @return
     */
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if (l1 == null || l2 == null) {
            return null;
        }
        ListNode temp = new ListNode(0);
        ListNode result = temp;

        int value1 = 0;
        int value2 = 0;
        while (l1 != null && l2 != null) {
            value2 = (l1.val + l2.val + value1) % 10;
            value1 = (l1.val + l2.val + value1) / 10;

            temp.next = new ListNode(value2);
            l1 = l1.next;
            l2 = l2.next;
            temp = temp.next;
            if (l1 == null && l2 == null) {
                break;
            }
            if (l1 == null) {
                l1 = new ListNode(0);
            }
            if (l2 == null) {
                l2 = new ListNode(0);
            }
        }
        if (value1 != 0) {
            temp.next = new ListNode(value1);
        }
        return result.next;
    }

方法4：

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode c1 = l1;
        ListNode c2 = l2;
        ListNode sentinel = new ListNode(0);
        ListNode d = sentinel;
        int sum = 0;
        while (c1 != null || c2 != null) {
            sum /= 10;
            if (c1 != null) {
                sum += c1.val;
                c1 = c1.next;
            }
            if (c2 != null) {
                sum += c2.val;
                c2 = c2.next;
            }
            d.next = new ListNode(sum % 10);
            d = d.next;
        }
        if (sum / 10 == 1)
            d.next = new ListNode(1);
        return sentinel.next;
    }
}

方法5：利用正则

public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int left = 0;
        ListNode dummy = new ListNode(0), tail = dummy;
        
        // iterate two list, add each position until 2 lists are finished && left equals to 0
        while(!(l1 == null && l2 == null && left == 0)){
            // is number1 finished?
            int add1 = l1 != null ? l1.val : 0;
            // is number2 finished?
            int add2 = l2 != null ? l2.val : 0;
            int sum = add1 + add2 + left;
            left = sum / 10;
            ListNode newNode = new ListNode(sum % 10);
            tail.next = newNode;
            tail = newNode;
            
            if(l1 != null) l1 = l1.next;
            if(l2 != null) l2 = l2.next;
        }
        
        return dummy.next;
    }