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

这道题难度不大，关键是要细心，在每次都创建新节点时在Leecode上出现内存空间不足的错误，所以只好利用其原始的节点保存和的信息，这里边需要注意的是三个指针要同步向前，另外就是最后要判断进位是否为0，不为0则要在最后添加新的节点。

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
		ListNode *head = new ListNode(0);
		ListNode *p = head;
		int flag = 0,sum = 0;
		while(l1 != NULL && l2 != NULL){
			sum = l1->val + l2->val + flag;
			flag = sum / 10;
			sum = sum % 10;
			l1->val = sum;
			p->next = l1;
			p = l1;
			l1 = l1->next;
			l2 = l2->next;
		}
		while (l1 != NULL){				
			sum = l1->val + flag;
			flag = sum / 10;
			l1->val = sum % 10;
			p->next = l1;
			p = l1;
			l1 = l1->next;
		}	
		while(l2 != NULL){
		    sum = l2->val + flag;
			flag = sum / 10;
			l2->val = sum % 10;
			p->next = l2;
			p = l2;
			l2 = l2->next;
		}	
		if(flag){
			ListNode *node = new ListNode(flag);
			p->next = node;
		}
		p = head->next;
		delete head;
		return p;
    }
};