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

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
struct ListNode
{
	int val;
	ListNode *next;
	ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
		if(l1 == NULL && l2 == NULL) return l1;
		long long a = 0,t = 1;
		while(l1 != NULL)
		{
			int s = l1->val * t;
			a += s;
			t *= 10;
			l1 = l1->next;
		}
		long long b = 0;
		t = 1;
		while(l2 != NULL)
		{
			int s = l2->val * t;
			b += s;
			t *= 10;
			l2 = l2->next;
		}
		long long c = a + b;
		ListNode *p = new ListNode(0);
		ListNode *q = NULL;
		ListNode *res = p;
		if(c == 0) return p;
		while(c)
		{
			q = new ListNode(c % 10);
			p->next = q;
			p = q;
			c /= 10;
		}
		return res->next;
    }
};