[LeetCode] Add Two Numbers 解题报告

—— write for my baby, mua

[题目]

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

[中文翻译]

给定两个链表，分别代表两个非负整数。链表的每个节点以逆序的方式存储整数的一位。将两个链表代表的整数相加，并以链表的形式返回结果。

输入： (2 -> 4 -> 3) + (5 -> 6 -> 4)
输出： 7 -> 0 -> 8

[解题思路]

本题的算法思路非常简单，设进位为carryBit，遍历两个数字的每一位，计算当前位的结果(List1->val+List2->val+carryBit)%10，计算下一位的进位(List1->val+List2->val+carryBit)/10。

相对而言本题比较复杂的是链表操作。

遍历链表：

while (List1 != NULL) { // Do something List1 = List1->next; }

链表尾添加节点（设now为当前链表尾）：

ListNode* add = new ListNode(num); now->next = add; now = now->next;

[C++代码]

/**
* 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* res = new ListNode(0);
		ListNode* now = res;
		int carryBit = 0;

		while (l1 != NULL && l2 != NULL) {
			int sum = l1->val + l2->val + carryBit;

			ListNode* add = new ListNode(sum % 10);
			carryBit = sum / 10;
			now->next = add;
			now = now->next;
			l1 = l1->next;
			l2 = l2->next;
		}

		while (l1 != NULL) {
			int sum = l1->val + carryBit;

			ListNode* add = new ListNode(sum % 10);
			carryBit = sum / 10;
			now->next = add;
			now = now->next;
			l1 = l1->next;
		}

		while (l2 != NULL) {
			int sum = l2->val + carryBit;

			ListNode* add = new ListNode(sum % 10);
			carryBit = sum / 10;
			now->next = add;
			now = now->next;
			l2 = l2->next;
		}

		if (carryBit > 0) {
			ListNode* add = new ListNode(carryBit);
			now->next = add;
		}

		res = res->next;

		return res;
	}
};