[leetcode][list] 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) {}
* };
*/
class Solution {
public:
	ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
		if (NULL == l1) return l2;
		if (NULL == l2) return NULL;

		int digit = (l1->val + l2->val) % 10;
		int carry = (l1->val + l2->val) / 10;
		ListNode *head = new ListNode(digit);//head指向结果链表的第一个节点，它是函数的返回值
		//p1指向l1的当前节点，p2指向l2的当前节点，pLast指向结果链表的最后一个节点，每添加一个节点，总是令pLash的next指向新节点，pLast后移一步
		ListNode *p1 = l1->next, *p2 = l2->next, *pLast = head; //注意申请多个指针时每个变量前面都要加*
		while (p1 && p2){
			digit = (p1->val + p2->val + carry) % 10;
			carry = (p1->val + p2->val + carry) / 10;
			ListNode *p = new ListNode(digit);
			pLast->next = p;
			pLast = pLast->next;
			p1 = p1->next;
			p2 = p2->next;
		}
		//p1、p2可能不一样长
		while (p1){
			digit = (p1->val + carry) % 10;
			carry = (p1->val + carry) / 10;
			ListNode *p = new ListNode(digit);
			pLast->next = p;
			pLast = pLast->next;
			p1 = p1->next;
		}
		while (p2){
			digit = (p2->val + carry) % 10;
			carry = (p2->val + carry) / 10;
			ListNode *p = new ListNode(digit);
			pLast->next = p;
			pLast = pLast->next;
			p2 = p2->next;
		}
		//记得如果最后有进位，需要再创建一个新节点
		if (carry){
			ListNode *p = new ListNode(carry);
			pLast->next = p;
		}
		return head;
	}
};