Leetcode NO.2 Add Two Numbers

最新推荐文章于 2024-11-11 20:59:17 发布

lym1108csu

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量404

点赞数

分类专栏： Leetcode 文章标签： leetcode 算法链表

本文链接：https://blog.csdn.net/u012290414/article/details/43082431

版权

Leetcode 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

题目要求如下：

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

如果是顺序的话，确实挺有难度，但是倒序的话，是没有太多难度的，就是注意细节就行了：比如链表操作，另外注意，如果在遍历完了之后，carry仍为1，即使此时两个list都指向NULL了，也需要再新加一个node.

代码如下：

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
    	ListNode* retVal = new ListNode(0);
    	ListNode* head = retVal;
    	int carry = 0;
    	while (l1 != NULL || l2 != NULL) {
    		int val1 = 0;
    		int val2 = 0;
    		if (l1 != NULL)
    			val1 = l1->val;
    		if (l2 != NULL)
    			val2 = l2->val;
    		int sum = val1 + val2 + carry;
    		if (sum >= 10) {
    			sum -= 10;
    			carry = 1;
    		}
    		else
    			carry = 0;
    		ListNode* cur = new ListNode(sum);
    		head->next = cur;
    		head = head->next;
    		if (l1 != NULL)
    			l1 = l1->next;
    		if (l2 != NULL)
    			l2 = l2->next;
    	}
    	if (carry != 0) {
    		ListNode* cur = new ListNode(1);
    		head->next = cur;
    		head = head->next;
    	}
    	return retVal->next;
    }
};