LeetCode2. Add Two Numbers

LeetCode2. Add Two Numbers

题目：

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) {
		int temp = 0, sum = 0;
		ListNode* head = new ListNode(-1), *tmp = head;
		//tmp = new ListNode(-1);
		while (l1 != NULL || l2 != NULL) {
			if (l1 == NULL) {
				ListNode* tmp1 = new ListNode((l2->val + temp) % 10);
				tmp->next = tmp1;
				temp = (l2->val + temp) / 10;
				tmp = tmp->next;
				l2 = l2->next;
			}
			else if (l2 == NULL) {
				ListNode* tmp1 = new ListNode((l1->val + temp) % 10);
				tmp->next = tmp1;
				temp = (l1->val + temp) / 10;
				tmp = tmp->next;
				l1 = l1->next;
			}
			else {
				ListNode* tmp1 = new ListNode((l2->val + temp + l1->val) % 10);
				tmp->next = tmp1;
				temp = (l2->val + temp + l1->val) / 10;
				tmp = tmp->next;
				l2 = l2->next;
				l1 = l1->next;
			}
		}
		if (temp != 0) {
			ListNode* tmp1 = new ListNode(temp);
			tmp->next = tmp1;
		}
		return head->next;
	}
};