LeetCode-Add Two Numbers

2. Add Two Numbers

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

链表的结构为：

package leetcode;

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

实现代码如下：

package leetcode;

/*2017-3-2
 * lk
 * 功能：链表，实现两个数的相加
 * 例如：9237 + 869
 * Input:链表为 * 7->3->2->9,9->->6->8
 * Output:输出链表为6->0->1->1->0->1
 * */
public class AddTwoNums {
	public static void main(String[] args){
		//ListNode ll = new ListNode(0);
		//ll.next = null;
		AddTwoNums add = new AddTwoNums();
		ListNode l1 = new ListNode(6);
		ListNode l2 = new ListNode(8);
		l1.next = null;
		l2.next = null;
		
		ListNode ll= add.addTwoNumbers(l1,l2);
		System.out.println(ll.val);
		System.out.println(ll.next.val);
	}
	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode ret = l1;
		ListNode pre = new ListNode(0);//用于最后结果的进位
		pre.next = l1;
		
		int flag = 0;
		while(l1 != null && l2 != null){
			l1.val = l1.val + l2.val + flag;
			flag = l1.val/10;
			l1.val = l1.val%10;
			pre = l1;
			l1 = l1.next;
			l2 = l2.next;
		}
		if(l2 != null){
			pre.next = l2;
			l1 = l2;
		}
		while(l1 != null){
			l1.val = l1.val + flag;
			flag = l1.val/10 ;
			l1.val = l1.val%10;
			pre = l1;
			l1 = l1.next;
		}
		if(flag > 0){
			ListNode node = new ListNode(1);
			pre.next = node;
		}
		return ret;
	}
}