002 - Add Two Numbers

Add Two Numbers

Total Accepted: 100874 Total Submissions: 477557 Difficulty: Medium

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

Subscribe to see which companies asked this question

 

其实就是两个大整数高低位倒置相加

 

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2) 
{
	int jin = 0;
	struct ListNode* ll = l1;
	struct ListNode* lr = l2;
	while (l1) {
		l1->val += jin;
		jin = 0;
		if (l2) {
			l1->val += l2->val;
			l2 = l2->next;
		}
		if (l1->val > 9) {
			jin = 1;
			l1->val -= 10;
		}

		if (!l1->next) {
			if (!l2) {
				if (jin) {
					lr->val = jin;
					l1->next = lr;
					lr->next = NULL;
					l1 = lr;
				}
			} else {
				l1->next = l2;
				l2 = NULL;
			}
		}
		l1 = l1->next;
	}

	return ll;
}


 

 

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值