【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

问题分析：常规题，没啥好分析的。

	 public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		 int flag=0;
		 ListNode newList = new ListNode(0);
		 ListNode temp = newList;
		 int tempInt=0;
		 if(l1==null)
			 return l2;
		 if(l2==null)
			 return l1;
		 while(l1!=null&&l2!=null){
			 ListNode node = new ListNode((l1.val+l2.val+flag)%10);
			 flag=(l1.val+l2.val+flag)/10;
			 temp.next=node;
			 temp=temp.next;
			 l1=l1.next;
			 l2=l2.next;
		 }
		 if(l1!=null||l2!=null){
			 if(l1==null) temp.next=l2;
			 if(l2==null) temp.next=l1;
			 temp=temp.next;
			 while(flag!=0&&temp.next!=null){
					tempInt=(temp.val+flag)%10;
					flag=(temp.val+flag)/10;
					temp.val=tempInt;
					temp=temp.next;
			}
			 if(temp.next==null){
				 	tempInt=(temp.val+flag)%10;
					flag=(temp.val+flag)/10;
					temp.val=tempInt;
					 if(flag==1){
						 ListNode node = new ListNode(1);
						 temp.next=node;
					 }
			 }
		 }
		 if(l1==null&&l2==null){
			 System.out.println("====");
			 if(flag==1){
				 ListNode node = new ListNode(1);
				 temp.next=node;
			 }
		 }
		 return newList.next;
	  }