【LeetCode】2. Add Two Numbers - Java实现

1. 题目描述：

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

2. 思路分析：

复用存储空间，用其中一个(如：l1)来存储最后结果。同时沿着这两个链表运算，当其中较短的结束后，变换一下指针，继续沿着较长的链表进行运算。

3. Java代码：

源代码：见我GiHub主页

/**
 * 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) {
        //用l1来存储最后结果，节省空间
        ListNode result = l1;
        ListNode cur = l1;
        int temp = 0;

        while (l1 != null && l2 != null) {
            cur = l1;
            temp = temp + l1.val + l2.val;
            cur.val = temp % 10;
            temp /= 10;
            l1 = l1.next;
            l2 = l2.next;
        }

        // 如果l1比较长，继续沿着l1运算
        while (l1 != null) {
            if (temp == 0) {
                break;
            }
            cur = l1;
            temp += l1.val;
            cur.val = temp % 10;
            temp /= 10;
            l1 = l1.next;
        }

        // 若l2比较长，先将指针指向l2，再沿着l2继续运算
        while (l2 != null) {
            cur.next = l2;
            if (temp == 0) {
                break;
            }
            cur = l2;
            temp += l2.val;
            cur.val = temp % 10;
            temp /= 10;
            l2 = l2.next;
        }

        // 如果运算完，产生了进位，则需要新增一个结点
        if (temp > 0) {
            cur.next = new ListNode(temp);
        }

        return result;
    }
}