leetcode 2. Add Two Numbers

翻译

有两个表示两个非负数字的链表。数字以相反的顺序存储，其节点包含单个数字。将这两个数字相加并将其作为一个链表返回。

输入: (2 -> 4 -> 3) + (5 -> 6 -> 4)
输出: 7 -> 0 -> 8

原文

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 

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *result = new ListNode(0);
        ListNode *p = result;
        while(l1!=NULL || l2!=NULL)
        {
            int carry = 0;
            if(l2!=NULL&&l1!=NULL)
            {
                result->val += (l1->val + l2->val);
                
                carry = (result->val/10);result->val = result->val %10;
            }
            else if(l1== NULL)
            {
                result->val += l2->val;
                
                carry = (result->val/10);result->val = result->val %10;
            }
            else if(l2==NULL)
            {
                result->val += l1->val;
                
                carry = (result->val/10);result->val = result->val %10;
            }
            
            if(l1!=NULL)
                l1 = l1->next;
            if(l2!=NULL)
                l2 = l2->next;
            if(l1!=NULL || l2!=NULL || carry!=0)
            {
                result->next = new ListNode(carry);
                result = result->next;
            }
        };
        
        return p;
    }
};