2. Add Two Numbers

最新推荐文章于 2025-01-13 12:09:11 发布

ballyyang

最新推荐文章于 2025-01-13 12:09:11 发布

阅读量138

点赞数

CC 4.0 BY-SA版权

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

本文链接：https://blog.youkuaiyun.com/ballyyang/article/details/80906013

leetcode 专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种使用链表实现两个非负整数相加的方法。输入的链表以逆序方式存储数字，每个节点包含一个数字。通过遍历链表并逐位相加的方式，返回结果作为一个新的链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

thought: arraylist.

 //Definition for singly-linked list.
 function ListNode(val) {
     this.val = val;
     this.next = null;
 }
/**
 * @param {ListNode} l1
 * @param {ListNode} l2
 * @return {ListNode}
 */
var addTwoNumbers = function(l1, l2) {
	let head = new ListNode(0);
	let current = head;
	let keep = 0;

	while (l1 || l2 || keep) {
		const sum = ( l1 ? l1.val : 0 ) + ( l2 ? l2.val : 0 ) + keep;
		keep = sum >= 10 ? 1 : 0;
		current.next = new ListNode(sum % 10);
		current = current.next;
		l1 = l1 ? l1.next : null;
		l2 = l2 ? l2.next : null;
	}

	return head.next;
}

//test

var a1 = new ListNode(2);
var a2 = new ListNode(4);
var a3 = new ListNode(3);
a1.next = a2;
a2.next = a3;

var b1 = new ListNode(5);
var b2 = new ListNode(6);
var b3 = new ListNode(4);
b1.next = b2;
b2.next = b3;

var s = addTwoNumbers(a1, b1);