[leetcode]2. Add Two Numbers@Java解题报告

https://leetcode.com/problems/add-two-numbers/description/

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

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

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

题意：这道题其实是大数相加的处理，但需要注意以下几点：

1.因为存储是反过来的，即数字342存成2->4->3，所以要注意进位是向后的；即链表尾是最高位

2.另外就是还要考虑最高位会不会产生进位

package go.jacob.day729;

/**
 * 2. Add Two Numbers
 * 
 * @author Java
 *
 */
public class Demo3 {
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		//进位
		int carry = 0;
		// 头结点，不存储结果
		ListNode head = new ListNode(0);
		ListNode pre = head;
		while (l1 != null || l2 != null || carry != 0) {
			int sum = (l1 == null ? 0 : l1.val) + (l2 == null ? 0 : l2.val) + carry;
			ListNode cur = new ListNode(sum % 10);
			carry = sum / 10;
			pre.next = cur;
			pre = cur;
			
			l1 = (l1 == null ? l1 : l1.next);
			l2 = (l2 == null ? l2 : l2.next);

		}

		return head.next;
	}

	private class ListNode {
		int val;
		ListNode next;

		ListNode(int x) {
			val = x;
		}
	}
}