LeetCode——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.

解决本题思路比较简单，先合并两表相同部分，然后合并剩余部分。

Runtime: 21 ms, faster than 93.90% of Java online submissions for Add Two Numbers.

/**
 * 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) {
        int carry = 0;
        // 创建表头和指针
        ListNode head = new ListNode(0);
        head.val = (l1.val+l2.val)%10;
        carry = (l1.val+l2.val)/10;
        l1 = l1.next;
        l2 = l2.next;
        ListNode pt = head;

        //合并表头共同部分，carry表进位数
        while(l1!=null && l2!=null){
            ListNode node = new ListNode((l1.val+l2.val+carry)%10);
            carry =  (l1.val+l2.val+carry)/10;
            pt.next = node;
            pt = pt.next; 
            l1 = l1.next;
            l2 = l2.next;
        }
        
        //合并剩余部分
        while(l1!=null){
            pt.next = l1;
            pt = pt.next;
            int temp = pt.val+carry;
            pt.val = temp%10;
            carry = temp/10;
            l1 = l1.next;
        }
        
        while(l2!=null){
            pt.next = l2;
            pt = pt.next;
            int temp = pt.val+carry;
            pt.val = temp%10;
            carry = temp/10;
            l2 = l2.next;
        }
        
        //判断进位是否为空，否则新增节点
        if(carry!=0)
            pt.next = new ListNode(carry);
       
        return head;
    }
}