LeetCode进阶之路（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

输入两个链表，倒叙组成两个整数并相加，342+465 = 807，以链表的形式输入；
光看英文连题目也看不懂，真是悲催，英语真是太渣了。。。

这道题的处理方法就是从两个链表中去出数据相加，但是有一点需要注意，就是进位。

方法：

public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		int carry = 0;
		ListNode head = null;
		ListNode result = null;
        while(l1 != null || l2 != null){
        	int sum = carry;
        	if(l1 != null){
        		sum += l1.val;
        		l1 = l1.next;
        	}
        	
        	if(l2 != null) {
        		sum += l2.val;
        		l2 = l2.next;
        	}
        	
        	if(sum/10 > 0){
        		carry = 1;
        	}else {
        		carry = 0;
        	}
        	sum = sum%10;
        	ListNode item = new ListNode(sum);
        	if(result == null) {
        		head = item;
        	}else {
        		result.next = item;
        	}
        	result = item;
        }
        if (carry!=0)
            result.next = new ListNode(1);
         
        return head;
    }

如何构造两个ListNode:

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

ListNode l1 = new ListNode(2);
		l1.next = new ListNode(4);
		l1.next.next = new ListNode(3);
		
		ListNode l2 = new ListNode(5);
		l2.next = new ListNode(6);
		l2.next.next = new ListNode(8);

总结：这道题用到了链表的概念，解题关键是进位，下一个节点计算时必须加上前一次的进位。