[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

题解： （1）注意处理进位问题。 （2） 注意两个链表长度不相等的时候。

 class Solution {
 public:
     ListNode *add(ListNode *l1, ListNode *l2,int c)
     {
         ListNode *head= new ListNode();
         if(l1==NULL && l2==NULL)
         {
             if(c==)
                return NULL;
             else
             {
                 head->val=;
                return head;
             }
         }
         if(l1==NULL)
             return add(head,l2,c);
         if(l2==NULL)
             return add(l1,head,c);

         if(l1!=NULL && l2!=NULL)
         {
            head->val =(l1->val + l2->val +c)%;
            c = (l1->val + l2->val +c)/;
            head->next = add(l1->next,l2->next,c);
         }
         return head;
     }
     ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
         int c=;
         if(l1==NULL) return l2;
         if(l2==NULL) return l1;

         ListNode *head = add(l1,l2,c);
         return head;
     }
 };

转载请注明出处：http://www.cnblogs.com/double-win/谢谢