算法初体验-2

Add Two Numbers

  Total Accepted: 49173  Total Submissions: 220247 My Submissions

Question  Solution 

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

Show Tags

Have you met this question in a real interview? 

Yes

 

No

Discuss

同样也是简单的加法，只是变成大数的加法，并且用链表实现，链表差点忘了，还是代码哈

 public static ListNode addTwoNumbers(ListNode l1, ListNode l2)
	 {
		 
		 ListNode result=null;
		 ListNode node=null;
		 ListNode thenext=null;
		 int up =0;//设置进位数
		 while(l1!=null&&l2!=null)
		 {   
			 int a=l1.val;
			 int b=l2.val;
			 thenext=new ListNode((a+b+up)%10);
			 //如果大于10 up置为1否则为0
			up=(a+b+up)/10;
			 if(result==null)
			 {
				 result = node = thenext;  
			 }
			 else 
			 {
				 node.next=thenext; 
				 node=thenext;
			 }
			 l1=l1.next;
			 l2=l2.next;
				 
		 }
		 //处理l1的剩下的
		   while(l1!=null)
			 {  
			    thenext = new ListNode((l1.val+up)%10); 
			    up=(l1.val+up)/10;
	            node.next = thenext;  
	            node=thenext;
	            l1=l1.next;
			 }
			 //处理l2的剩下的
		   while(l2!=null)
			 {
			   thenext = new ListNode((l2.val+up)%10); 
			    up=(l2.val+up)/10;
	            node.next = thenext;  
	            node=thenext;
	            l2=l2.next;
			 }
		//如果还剩下高位
		   if (up > 0)  
	        {  
	            thenext = new ListNode(up);  
	            node.next = thenext;  
	        }  
		
		 return result; 
		
		
     }