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

开始打算直接把它们变成两个数直接相加，后来想到如果数非常大，比如几百上千位，肯定不行，所以改用下面的思路。
整体来说遍历的方式有点归并排序的味道，边移动边移动边加，直到某一个移到头了，如果有另一个没移到头就接着去移另一个。
当然你也可以直接改其中的某一个链表，省点存储空间，为了不改变原来的链表，我下面的代码是另外加了条链表存储。

/**
 * 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) {
        if (l1 == null || l2 == null) {
            return null;
        }
        ListNode l3 = new ListNode(0);
        ListNode q = l3,p;
        int carryFlag = 0;//进位标志
        int temp;//用来存每位相加的数
        while (l1 != null && l2 != null) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            temp = l1.val + l2.val + carryFlag;
            q.val = temp % 10;
            carryFlag = temp / 10;
            l1 = l1.next;
            l2 = l2.next;
        }
        while (l1 != null) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            temp = l1.val + carryFlag;
            q.val = temp % 10;
            carryFlag = temp / 10;
            l1 = l1.next;
        }
        while (l2 != null) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            temp = l2.val + carryFlag;
            q.val = temp % 10;
            carryFlag = temp / 10;
            l2 = l2.next;
        }
        //如果都遍历完了，还有进位，再new个节点来放
        if (carryFlag != 0) {
            p = new ListNode(carryFlag);
            q.next = p;
            q = p;
        }
        q.next = null;
        //因为我加了个头结点(习惯了。。)，而题目是没有头结点的
	//所以返回l3.next(下面写了个不带头结点的，其实区别很小的。。)
        return l3.next;
    }
}

不带头结点的

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if (l1 == null || l2 == null) {
            return null;
        }
        ListNode l3 = new ListNode(0);
        ListNode q = l3,p;
        int carryFlag = 0;//进位标志
        int temp;//用来存每位相加的数

        //其实不带头结点的就是把第一个节点的拿到循环外面单独处理下，以免丢掉指向第一个节点的指针，
        //当然你也可以放到循环里面,然后加个标志位，如果是第一个节点，就把指向它的指针记下来，不过
        //这样每次循环都会判断下，未免影响效率
        
        temp = l1.val + l2.val + carryFlag;
        q.val = temp % 10;
        carryFlag = temp / 10;
        l1 = l1.next;
        l2 = l2.next;

        while (l1 != null && l2 != null) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            temp = l1.val + l2.val + carryFlag;
            q.val = temp % 10;
            carryFlag = temp / 10;
            l1 = l1.next;
            l2 = l2.next;
        }
        while (l1 != null) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            temp = l1.val + carryFlag;
            q.val = temp % 10;
            carryFlag = temp / 10;
            l1 = l1.next;
        }
        while (l2 != null) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            temp = l2.val + carryFlag;
            q.val = temp % 10;
            carryFlag = temp / 10;
            l2 = l2.next;
        }
        if (carryFlag != 0) {
            p = new ListNode(carryFlag);
            q.next = p;
            q = p;
        }
        q.next = null;
        return l3;
    }
}

在好奇心驱使下，我实现了下最初那种把它们转换成整数再处理，实验证明，long可以过掉，int过不掉，看来测试数据也不算太残暴，嘿嘿。代码如下：

public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if (l1 == null || l2 == null) {
            return null;
        }
        long num1 = 0,num2 = 0,tempNum = 1;
        //这里要注意因为这里链表是逆序的，所以和我们经常写的那类字符串转整数有点区别
        while (l1 != null) {
            num1 += tempNum*l1.val;
            tempNum *= 10;
            l1 = l1.next;
        }
        tempNum = 1;
        while (l2 != null) {
            num2 += tempNum*l2.val;
            tempNum *= 10;
            l2 = l2.next;
        }
        num1 += num2;
        ListNode l3 = new ListNode(0);
        ListNode q = l3,p;
        q.val = (int)(num1 % 10);
        num1 /= 10;
        while (num1 != 0) {
            p = new ListNode(0);
            q.next = p;
            q = p;
            q.val = (int)num1 % 10;
            num1 /= 10;
        }
        q.next = null;
        return l3;
    }
}