Leetcode-2. 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

AC.

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { 
	    int len1,len2;
    	len1=len2=0;
    	ListNode* tmp=0;
    	for(tmp=l1; tmp->next!=NULL; tmp=tmp->next) len1++;
    	for(tmp=l2; tmp->next!=NULL; tmp=tmp->next) len2++;
    	len1++; len2++;
    	if(len1>=len2){	//2+1
    		tmp=l1;
    		while(l2!=NULL){
    			tmp->val+=l2->val;
    			tmp=tmp->next;
    			l2=l2->next;
    		}
    		tmp=l1;
    		while(tmp!=NULL){
    			if(tmp->val<10){
    				tmp=tmp->next;
    				continue;
    			}
    			else{
    				tmp->val%=10;
    				if(tmp->next!=NULL){
    					tmp->next->val++;
    				}
    				else{
    					ListNode* newnode=new ListNode(1);
    					tmp->next=newnode;
    				}
    				tmp=tmp->next;
    			}
    		}
    		return l1;
    	}
    	else{			//1+2
    		tmp=l2;
    		while(l1!=NULL){
    			tmp->val+=l1->val;
    			tmp=tmp->next;
    			l1=l1->next;
    		}
    		tmp=l2;
    		while(tmp!=NULL){
    			if(tmp->val<10){
    				tmp=tmp->next;
    				continue;
    			}
    			else{
    				tmp->val%=10;
    				if(tmp->next!=NULL){
    					tmp->next->val++;
    				}
    				else{
    					ListNode* newnode=new ListNode(1);
    					tmp->next=newnode;
    				}
    				tmp=tmp->next;
    			}
    		}
    		return l2;
    	}   
    }
};

总结：两个链表相加，将短链表加到长链表上，再对长链表进行进位处理即可。