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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

Solution1：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int sum = l1.val + l2.val;
        int carry = sum/10;
        ListNode head = new ListNode(sum % 10);
        ListNode temp = head;
        while(l1.next != null && l2.next != null){
            l1 = l1.next;
            l2 = l2.next;
            sum = l1.val + l2.val + carry;
            carry = sum/10;
            temp.next =  new ListNode(sum % 10);
            temp = temp.next;
        }
        if(carry==0){
            if(l1.next != null){
                temp.next = l1.next;
            }else if(l2.next != null){
                temp.next = l2.next;
            }
        }else{
            ListNode remain = null;
            if(l1.next != null){
                remain = l1;
            }else if(l2.next != null){
                remain = l2;
            }
            if(remain == null){
                temp.next = new ListNode(carry);
            }else{
                while(remain.next != null){
                    remain = remain.next;
                    sum = remain.val + carry;
                    carry = sum/10;
                    temp.next =  new ListNode(sum % 10);
                    temp = temp.next;
                }
                if(carry != 0){
                    temp.next = new ListNode(carry);
                }
            }
        }
        return head;
    }
}

Solution2：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int sum , carry = 0;
        ListNode head = new ListNode(0);
        ListNode temp = head;
        while(l1 != null || l2 != null || carry != 0){
            sum = carry;
            if(l1!=null){
                sum += l1.val;
                l1 = l1.next;
            }
            if(l2!=null){
                sum += l2.val;
                l2 = l2.next;
            }
            carry = sum/10;
            temp.next =  new ListNode(sum % 10);
            temp = temp.next;
        }
        return head.next;
    }
}