LeetCode之2. Add Two Numbers

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse orderand 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.

就是两个链表表示的数相加：

这样就可以实现两个很大的数相加了，无需考虑数值 int ，float 的限制了。

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		/*
		 * if (l1.val == 0) return l2; else if (l2.val == 0) return l1;
		 * 这段代码不能要；
		 * 如果其中一个数的个位为0时，这里就会直接返回另一个数；
		 */

		ListNode resultTemp = new ListNode((l1.val + l2.val) % 10);
		int cout = (l1.val + l2.val) / 10;
		ListNode result = resultTemp;
		l1 = l1.next;
		l2 = l2.next;

		ListNode cur = null;
		ListNode pre = null;

		while (l1 != null && l2 != null) {
			cur = new ListNode((l1.val + l2.val + cout) % 10);
			cout = (l1.val + l2.val + cout) / 10;
			resultTemp.next = cur;
			resultTemp = resultTemp.next;

			l1 = l1.next;
			l2 = l2.next;
		}

		if (l1 == null && l2 == null) { // 1) 第一次添加了这里
			if (cout != 0) { // 3) 第三次添加了这里
				resultTemp.next = new ListNode(cout);
			}
		} else if (l1 == null) {
			cur = l2;
			while (cur != null && (cur.val + cout) >= 10) {
				int temp = cur.val + cout;
				cur.val = temp % 10;
				cout = temp / 10;
				pre = cur;
				cur = cur.next;
			}
			if (cur != null) {
				cur.val = cur.val + cout; // 2) 第二次添加了这里
			} else {
				pre.next = new ListNode(cout);
			}
			resultTemp.next = l2;
		} else {
			cur = l1;
			while (cur != null && (cur.val + cout) >= 10) {
				int temp = cur.val + cout;
				cur.val = temp % 10;
				cout = temp / 10;
				pre = cur;
				cur = cur.next;
			}
			if (cur != null) {
				cur.val = cur.val + cout; // 2)
			} else {
				pre.next = new ListNode(cout);
			}
			resultTemp.next = l1;
		}

		return result;
	}

1）和3）是为了防止两条链表都走到头了，但是进位cout还存在，还需要再多创建一个节

点，把进位cout中的值作为该节点的值，也就是作为结果的最高位的值；

2）处，依然是为了处理可能存在的进位的cout问题；

 

public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		/*
		 * if (l1.val == 0) return l2; else if (l2.val == 0) return l1;
		 * 这段代码不能要；
		 * 如果其中一个数的个位为0时，这里就会直接返回另一个数；
		 */

		ListNode resultTemp = new ListNode((l1.val + l2.val) % 10);
		int cout = (l1.val + l2.val) / 10;
		ListNode result = resultTemp;
		l1 = l1.next;
		l2 = l2.next;

		ListNode cur = null;
		ListNode pre = null;

		while (l1 != null && l2 != null) {
			cur = new ListNode((l1.val + l2.val + cout) % 10);
			cout = (l1.val + l2.val + cout) / 10;
			resultTemp.next = cur;
			resultTemp = resultTemp.next;

			l1 = l1.next;
			l2 = l2.next;
		}

		if (l1 == null && l2 == null) { // 1) 第一次添加了这里
			if (cout != 0) { // 3) 第三次添加了这里
				resultTemp.next = new ListNode(cout);
			}
		} else if (l1 == null) {
			cur = l2;
			helper(cur,cout);
			resultTemp.next = l2;
		} else {
			cur = l1;
			helper(cur,cout);
			resultTemp.next = l1;
		}

		return result;
	}

	public static void helper(ListNode cur,int cout) {
		ListNode pre = null;
		while (cur != null && (cur.val + cout) >= 10) {
			int temp = cur.val + cout;
			cur.val = temp % 10;
			cout = temp / 10;
			pre = cur;
			cur = cur.next;
		}
		if (cur != null) {
			cur.val = cur.val + cout; // 2) 第二次添加了这里
		} else {
			pre.next = new ListNode(cout);
		}
	}

由于上面有重复代码，所以提取了一个功能函数helper()，helper()是为了处理当一条链表走完了，但是另外一条链表还有节点没有处理完时的情况；

 

别人的代码：

Runtime: 21 ms, faster than 92.88% of Java online submissions for Add Two Numbers.

Memory Usage: 34.3 MB, less than 39.35% of Java online submissions for Add Two Numbers.

public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
    ListNode c1 = l1;
    ListNode c2 = l2;
    ListNode sentinel = new ListNode(0); // 哨兵节点
    ListNode d = sentinel;
    int sum = 0;
    while (c1 != null || c2 != null) {
        sum /= 10;
        if (c1 != null) {
            sum += c1.val;
            c1 = c1.next;
        }
        if (c2 != null) {
            sum += c2.val;
            c2 = c2.next;
        }
        d.next = new ListNode(sum % 10); // “sum%10”等价于，“sum>=10 ? sum-10 : sum”      但后者要快太多；
        d = d.next;
    }
    if (sum / 10 == 1) // 这里不能是sun == 1
        d.next = new ListNode(1);
    return sentinel.next;
}

别人的代码2（递归版）：

Runtime: 22 ms, faster than 71.71% of Java online submissions for Add Two Numbers.

Memory Usage: 37.6 MB, less than 18.37% of Java online submissions for Add Two Numbers.

public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
	if (l1 == null && l2 == null) 
		return null;
	int val = (l1 == null ? 0 : l1.val) + (l2 == null ? 0 : l2.val);
	ListNode head = new ListNode(val % 10);
	head.next = addTwoNumbers(l1 == null ? null : l1.next, l2 == null ? null : l2.next);
	if (val >= 10) 
		head.next = addTwoNumbers(head.next, new ListNode(1)); // 应对个位可能向十位的进位
	return head;
}