【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
 *
 */

#include <iostream>
#include <string>
#include <vector>
using namespace std;

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

ListNode* addTwoNumbers(ListNode* l1, ListNode* l2)
{
    ListNode *p = new ListNode(0);
    ListNode *h = p;

    int extra = 0, sum = 0;
    while (l1 || l2 || extra)
    {
        sum = l1->val + l2->val + extra;
        extra = sum / 10;

        p->next = new ListNode(sum % 10);
        p = p->next;

        l1 = l1 ? l1->next : NULL;
        l2 = l2 ? l2->next : NULL;
    }

    return h->next;
}

int main()
{
    ListNode *ph1;
    //243 564
    ListNode n1(2);
    ListNode n2(4);
    ListNode n3(3);
    n1.next = &n2;
    n2.next = &n3;

    ph1 = &n1;

    ListNode *ph2;
    //243 564
    ListNode n4(5);
    ListNode n5(6);
    ListNode n6(4);
    n4.next = &n5;
    n5.next = &n6;

    ph2 = &n4;

    ListNode *ph3;
    ph3 = addTwoNumbers(ph1, ph2);
    while (ph3 != NULL)
    {
        cout << ph3->val << "   ";
        ph3 = ph3->next;
    }
    cout << endl;

    system("pause");
    return 0;
}