LeetCode Add Two Numbers

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


正确简单才是王道!

struct ListNode {
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};

class Solution {
public:
    ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
		ListNode* ret = NULL;
		ListNode** cur = &ret;
		int carry = 0;
		int sum = 0;

		while(l1 != NULL || l2 != NULL)
		{
			sum = carry;
			if(l1 != NULL)
			{
				sum += l1->val;
				l1 = l1->next;
			}
			if(l2 != NULL)
			{
				sum += l2->val;
				l2 = l2->next;
			}

			carry = sum/10;
			sum %= 10;
			*cur = new ListNode(sum);
			cur = &(*cur)->next;
		}

        if(carry > 0)
			*cur = new ListNode(carry);

		return ret;
    }
};





评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值