LeetCode 2. Add Two Numbers（medium）

题目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.

解题思路：
一、
①当l1、l2都存在时，循环将每位数字加起来，新建节点来存储个位数的值（取余运算），取模运算得到进位的值继续加到下一位。
若某一链表不存在，则不加该位数字即可（也可当做＋0处理）。
②每次新建ListNode并返回其头结点的下一个。
③如果循环结束后还有进位，就继续新建节点存carry。

/**
 * 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) {
        if(l1==null)return l2;
        if(l2==null)return l1;
        ListNode list=new ListNode(0);
        ListNode current=list;
        int carry=0;
        while(l1!=null&&l2!=null){
            int sum=l1.val+l2.val+carry;
            int val=sum%10;
            carry=sum/10;
            ListNode newNode=new ListNode(val);
            current.next=newNode;
            current=current.next;
            l1=l1.next;
            l2=l2.next;
        }
        while(l1!=null){
            int sum=l1.val+carry;
            int val=sum%10;
            carry=sum/10;
            ListNode newNode=new ListNode(val);
            current.next=newNode;
            current=current.next;
            l1=l1.next;
            
        }
        while(l2!=null){
            int sum=l2.val+carry;
            int val=sum%10;
            carry=sum/10;
            ListNode newNode=new ListNode(val);
            current.next=newNode;
            current=current.next;
            l2=l2.next;
        }
        if(carry!=0) current.next=new ListNode(carry);
        return list.next;
        
    }
}

参考代码（优化版本）：

/**
 * 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=new ListNode(0);
        ListNode current=list;
        int carry=0;
        while(l1!=null||l2!=null||carry!=0){
            ListNode newNode=new ListNode(0);
            int sum=((l1==null)?0:l1.val)+((l2==null)?0:l2.val)+carry;
            newNode.val=sum%10;
            carry=sum/10;
            list.next=newNode;
            list=newNode;
            l1=(l1==null)?l1:l1.next;
            l2=(l2==null)?l2:l2.next;
        }
        return current.next;
        
    }
}