LeetCode-Add Two Numbers-解题报告

最新推荐文章于 2024-08-12 10:14:14 发布

dinglin0xff

最新推荐文章于 2024-08-12 10:14:14 发布

阅读量261

点赞数

分类专栏： leetcode 文章标签： C++ leetcode

本文链接：https://blog.csdn.net/dd523762588/article/details/46808937

版权

leetcode 专栏收录该内容

69 篇文章 0 订阅

订阅专栏

原题链接 https://leetcode.com/problems/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 (l1 == NULL)return l2;
		if (l2 == NULL)return l1;
		ListNode *ans, *tmp, *head;
		int c = 0, flag = 0;
		for (; l1 != NULL || l2 != NULL;)
		{
			int a = 0, b = 0;
			if (l1 != NULL)a = l1->val;
			if (l2 != NULL)b = l2->val;
			a = a + b + c;
			c = a / 10;
			a = a % 10;
			tmp = new ListNode(a);
			if (flag == 0)ans = tmp, flag = 1, head = tmp;
			else head->next = tmp, head = head->next;
			if (l1 != NULL)l1 = l1->next;
			if (l2 != NULL)l2 = l2->next;
		}
		if (c)
			tmp = new ListNode(c), head->next = tmp;
		return ans;
	}
};