【LeetCode】002.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

解答：

同步遍历2个链表，计算和，大于10则进位，计算终止条件是l1 == null && l2 == null && carry == 0;

代码：

/**
 * 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) {
		ListNode head = null,cur=null;
		int carry = 0;
		while(l1 != null || l2 != null || carry != 0){
			int l1Val = l1 == null ? 0 : l1.val;
			int l2Val = l2 == null ? 0 : l2.val;
			int sum = l1Val + l2Val + carry;
			if(sum >= 10){
				carry = 1;
				sum -= 10;
			} else 
				carry = 0;
			if(head == null){
				head = new ListNode(sum);
				cur = head;
			} else {
				cur.next = new ListNode(sum);
				cur = cur.next;
			}
			l1 = l1 == null ? null : l1.next;
			l2 = l2 == null ? null : l2.next;
		}
		return head;
	}
}