[LeetCode] 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

分析:

非常简单一道题。我居然还没有一次过!真是想自残。。

代码:

class Solution {
public:
	ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
		ListNode *fakeHead = new ListNode (-1);
		ListNode *current = fakeHead;
		int carry = 0;
		while (l1 || l2 || carry != 0) {
			int left = l1 ? l1->val : 0;
			int right = l2 ? l2 ->val : 0;
			int sum = right + left + carry;
			current->next = new ListNode(sum % 10);
			carry = sum / 10;
			l1 = !l1 ? NULL : l1->next;
			l2 = !l2 ? NULL : l2->next;
			current = current->next;
		}
		ListNode *head = fakeHead->next;
		delete fakeHead;
		return head;
	}
};



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值