LeetCode-java实现-T2-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

注意：1.最后要返回头指针

          2.注意进位

  3.注意当两个链表长度不一致时，不要用空的结点

package org.algorithm.leetcode;
class ListNode {
	int val;
	ListNode next;
	ListNode(int x) { val = x; }
}
public class Item2 {
	 public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		 if(l1 == null) 
			 return l2;
		 
		 if(l2 == null)
			 return l1;
		 
		 int temp = 0;
		 int num = 0;//表示进位
		 //头结点
		 temp = l1.val + l2.val + num;
		 if(temp >= 10) {
			 num = 1;
			 temp = temp - 10;
		 }else {
			 num = 0;
		 }
		 ListNode head = new ListNode(temp);
		 //之后的结点
		 ListNode n1 = l1.next;
		 ListNode n2 = l2.next;	 
		 ListNode l = head; 
		 while(n1 != null || n2 != null) {
			 ListNode _l = new ListNode(0);
			 if(n1 == null) {
				 temp = n2.val + num; 
				 n2 = n2.next;
			 } else if(n2 == null) {
				 temp = n1.val + num;
				 n1 = n1.next;
			 } else {
				 temp = n1.val + n2.val + num;
				 n1 = n1.next;
				 n2 = n2.next;
			 } 
			 if(temp >= 10) {
				 num = 1;
				 temp = temp - 10;
			 }else {
				 num = 0;
			 }
			 _l.val = temp;
			l.next = _l;
			l = _l;
		 }
		 //当最后加完了还有进位，要保存进位
		 if(num > 0) {
			 ListNode _l = new ListNode(num);
			 l.next = _l;
		 }
			
	     return head;  
	 }
	 
	 public static void main(String[] args) {
		 ListNode l1 = new ListNode(2);
		 ListNode l1_2 = new ListNode(4);
		 ListNode l1_3 = new ListNode(3);
		 l1.next = l1_2;
		 l1_2.next = l1_3;
		 ListNode l2 = new ListNode(5);
		 ListNode l2_2 = new ListNode(6);
		 ListNode l2_3 = new ListNode(6);
		 l2.next = l2_2;
		 l2_2.next = l2_3;
		 ListNode head = addTwoNumbers(l1,l2);
		 while(head != null) {
			 System.out.print(head.val+" ");
			 head = head.next;
		 }
		 
	 }
}