leetcode 两数相加（链表）

You are given two non-empty linked lists representing two non-negative integers. 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.

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.
第一次写的（代码比较啰嗦）

class Solution {
public:
	ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
		if (!l1 && !l2) return NULL;
		if (!l1) return l2;
		if (!l2) return l1;
		ListNode *p1 = l1;
		ListNode *p2 = l2;
		ListNode *res = new ListNode(-1);
		ListNode *tmp = res;
		int count = 0;
		int sum = 0;
		while (p1 && p2) {
			count += p1->val + p2->val;
			sum = count >= 10 ? count-10 : count;
			count /= 10;
			tmp->next = new ListNode(sum);
			tmp = tmp->next;
			p1 = p1->next;
			p2 = p2->next;
		}
        if(!p1 && !p2 && count) tmp->next = new ListNode(1);
		if (p1) {
			tmp->next = p1;
			ListNode *ppre = p1;
			while (p1 && count) {
				count += p1->val;
				p1->val = count >= 10 ? count-10 : count;
				count /= 10;	
				ppre = p1;
				p1 = p1->next;
			}
			if (count) ppre->next = new ListNode(1);
		}
		if (p2) {
			tmp->next = p2;
			ListNode *ppre = p2;
			while (p2 && count) {
				count += p2->val;
				p2->val = count >= 10 ? count - 10 : count;
				count /= 10;
				ppre = p2;
				p2 = p2->next;
			}
			if (count) ppre->next = new ListNode(1);
		}
        
		return res->next;
	}
};

参考别人的简洁代码：

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *result = new ListNode(0);
        ListNode *tmp = result;
        int sum = 0;
        while(l1 || l2){      
            if(l1){
                sum += l1->val;
                l1 = l1->next;
            }
            if(l2){
                sum += l2->val;
                l2 = l2->next;
            }
            tmp->next = new ListNode(sum%10);
            sum /= 10;
            tmp = tmp->next;
        }
        if(sum)
            tmp->next = new ListNode(1);
        return result->next;
    }
};