leetcode 练习题 -- 2. Add Two Numbers

Description

You are given two non-empty linked lists representing two non-negative integers. The digits are stored inreverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

/**
* 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 *l3, *head, *p;
		l3 = (ListNode *)malloc(sizeof(ListNode));
		l3->next = NULL;
		head = l3;

		int r = 0;
		while (l1&&l2)
		{
			ListNode* t = (ListNode *)malloc(sizeof(ListNode));

			t->val = (l1->val + l2->val + r) % 10;
			r = (l1->val + l2->val + r) / 10;

			t->next = l3->next;
			l3->next = t;
			l3 = t;

			l1 = l1->next;
			l2 = l2->next;
		}
		if (r && !l1 && !l2)
		{
			ListNode* t = (ListNode *)malloc(sizeof(ListNode));

			t->val = r;

			t->next = l3->next;
			l3->next = t;
			l3 = t;
		}
		if (l1)
		{
			while (r&&l1)
			{
				ListNode* t = (ListNode *)malloc(sizeof(ListNode));

				t->val = (l1->val + r) % 10;
				r = (l1->val + r) / 10;

				t->next = l3->next;
				l3->next = t;
				l3 = t;

				l1 = l1->next;
			}
			if (l1)
				l3->next = l1;
			if (r)
			{
				ListNode* t = (ListNode *)malloc(sizeof(ListNode));

				t->val = r;

				t->next = l3->next;
				l3->next = t;
				l3 = t;
			}
		}
		if (l2)
		{
			while (r&&l2)
			{
				ListNode* t = (ListNode *)malloc(sizeof(ListNode));

				t->val = (l2->val + r) % 10;
				r = (l2->val + r) / 10;

				t->next = l3->next;
				l3->next = t;
				l3 = t;

				l2 = l2->next;

			}
			if (l2)
				l3->next = l2;
			if (r)
			{
				ListNode* t = (ListNode *)malloc(sizeof(ListNode));

				t->val = r;

				t->next = l3->next;
				l3->next = t;
				l3 = t;
			}
		}
		p = head;
		p = p->next;
		while (p->next != NULL)
		{
			cout << p->val << " -> ";
			p = p->next;
		}
		cout << p->val;
		return head->next;
	}
};