将两个数（链表形式）相加，数字是反序存储的

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.

（给定两个非空的链表，表示两个非负整数。 数字以相反的顺序存储，并且它们的每个节点包含单个数字。 添加两个数字并将其作为链接列表返回。
您可以假设两个数字不包含任何前导零，除了数字0本身。）

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

程序如下：

public class AddTwoLinklist {

	public static ListNode AddTwo(ListNode l1,ListNode l2){
		ListNode c1 = l1;
		ListNode c2 = l2;
		ListNode s = new ListNode(0);
		ListNode d = s;
		int sum = 0;		//用来记录对应数字相加之和
		
		while(c1 != null || c2 != null){	//判断结点中是否含有数字
			sum /= 10;				//不同位数的和进行更新，即前两位的和超过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);	//逐渐往后创建新结点进行存储
			d = d.next;
		}
		if(sum / 10 == 1)				//最后一位有进位时，则要创建一个新结点进行扩位
			d.next = new ListNode(1);
		return s.next;
		
	}
	
	
	public static void main(String[] args) {
		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(4);
		
//		while(l1 != null){
//			System.out.print(l1.val);
//			l1 = l1.next;
//		}while(l2 != null){
//			System.out.print(l2.val);
//			l2 = l2.next;
//		}
		
		ListNode ss = AddTwo(l1, l2);
		while(ss != null){
			System.out.print(ss.val);
			ss = ss.next;
		}
	}
	
}


//自定义节点类
class ListNode{
	int val;
	ListNode next;
	ListNode(int val){
		this.val = val;
	}
}

//这个相对简单些
	public static ListNode AddTwo2(ListNode l1,ListNode l2){
		ListNode prev = new ListNode(0);
		ListNode head = prev;
		int carry = 0;
		
		while(l1 != null || l2 != null || carry != 0){
			ListNode cur = new ListNode(0);
			int sum = ((l1 == null) ? 0 : l1.val) + ((l2 == null) ? 0 : l2.val) + carry;
			cur.val = sum % 10;
			carry = sum / 10;
			
			prev.next = cur;
			prev = cur;
			
			l1 = (l1 == null) ? l1 :l1.next;
			l2 = (l2 == null) ? l2 :l2.next;
			
		}
		return head.next;
	}