LeetCode - Add Two Numbers

作者：disappearedgod

文章出处：http://blog.csdn.net/disappearedgod/article/details/23810157

时间：2014-4-16

题目

Add Two Numbers

  Total Accepted: 11480  Total Submissions: 50652 My Submissions

You are given two linked lists representing two non-negative numbers. 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.

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

解题

This is a simple problem. It can be solved by doing the following:

1. Use a flag to mark if previous sum is >= 10
2. Handle the situation that one list is longer than the other
3. Correctly move the 3 pointers p1, p2 and p3 which pointer to two input lists and one output list

This leads to solution 1.

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int carry = 0;
        ListNode newHead = new ListNode(0);
        ListNode p1 = l1, p2 = l2, p3 = newHead;
        
        while(p1!=null ||p2!=null){
            if(p1!=null){
                carry += p1.val;
                p1 = p1.next;
            }
            if(p2!=null){
                carry += p2.val;
                p2 = p2.next;
            }
            p3.next = new ListNode(carry%10);
            p3=p3.next;
            carry /=10;
        }
        if(carry == 1)
            p3.next = new ListNode(1);
        return newHead.next;
    }
}

返回

LeetCode Solution(持续更新，java>c++)