leetcode: add-two-numbers

题目描述:

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

解题思路：

1. 这道题很好理解，意思就是说，给定两个字符串，它们表示的是一个倒的数，求它们的和，求得的结果也用链表倒置
2. 这道题首先想到的解法是直接将他们反过来，求和，再将结果倒过来
3. 很显然这种方法是笨方法，我们可以直接根据加法的原理，从头到尾求解即可
4. 注意最后的进位，需要单独处理一下

代码如下：

    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if(l1 == null) return l2;
        if(l2 == null) return l1;

        ListNode dummy = new ListNode(-1);
        ListNode p = dummy;

        int sum = 0;
		
	// 依次取出两个链表中的数，相加直至其中一个或两个链表遍历结束
        while(l1 != null && l2 != null){
            sum += l1.val + l2.val;
            ListNode temp = new ListNode(sum % 10);
            p.next = temp;
            p = p.next;
            sum /= 10;
            l1 = l1.next;
            l2 = l2.next;
        }

	// 单个链表为空时
        while(l1 != null){
            sum += l1.val;
            ListNode temp = new ListNode(sum % 10);
            p.next = temp;
            p = p.next;
            l1 = l1.next;
            sum /= 10;
        }

        while(l2 != null){
            sum += l2.val;
            ListNode temp = new ListNode(sum % 10);
            p.next = temp;
            p = p.next;
            l2 = l2.next;
            sum /= 10;
        }

	// 最后处理一下末位的进位问题
        if(sum > 0)
            p.next = new ListNode(sum);

        return dummy.next;
    }

转载于:https://my.oschina.net/happywe/blog/3085909