LeetCode面试题 02.05. 链表求和

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        if (l1 == NULL && l2 == NULL)
        {
            ListNode* p = new ListNode(0);
            return p;
        }
        if (l1 == NULL || l2 == NULL)
        {
            return l1 == NULL ? l2 : l1;
        }

        int carry = 0;

        ListNode* head;
        ListNode* q;
        int flag = 0;

        while (l1 && l2)
        {
            int temp = l1->val + l2->val + carry;

            if (temp >= 10)
            {
                carry = 1;
                temp = temp - 10;
            }
            else
            {
                carry = 0;
            }

            ListNode* p = new ListNode(temp);
            if (!flag)
            {
                head = p;
                q = p;
                flag = 1;
            }
            else
            {
                q->next = p;
                q = p;
            }
            
            l1 = l1->next;
            l2 = l2->next;
        }

        ListNode* t = l1 == NULL ? l2 : l1;
        while (t)
        {
            int temp = t->val + carry;
            if (temp >= 10)
            {
                carry = 1;
                temp = temp - 10;
            }
            else
            {
                carry = 0;
            }
            ListNode* p = new ListNode(temp);
            q->next = p;
            q = p;
            t = t->next;
        }

        if (carry)
        {
            q->next = new ListNode(carry);
        }

        return head;
    }
};