add-two-numbers-ii

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.

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

&nbsp;
Example 1:
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/09/sumii-linked-list.jpg" style="width: 523px; height: 342px;" />
<pre>
Input: l1 = [7,2,4,3], l2 = [5,6,4]
Output: [7,8,0,7]
</pre>

Example 2:

<pre>
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [8,0,7]
</pre>

Example 3:

<pre>
Input: l1 = [0], l2 = [0]
Output: [0]
</pre>

&nbsp;
Constraints:

<ul>
	<li>The number of nodes in each linked list is in the range <code>[1, 100]</code>.</li>
	<li><code>0 &lt;= Node.val &lt;= 9</code></li>
	<li>It is guaranteed that the list represents a number that does not have leading zeros.</li>
</ul>

&nbsp;
Follow up:&nbsp;Could you solve it without reversing the input lists?

addTwoNumbers

Add Two Numbers II

Add Two Numbers

add-two-numbers

两数相加

Add Two Polynomials Represented as Linked Lists

add-two-polynomials-represented-as-linked-lists

求两个多项式链表的和

Stack

Linked List

Math

给你两个 非空 链表来代表两个非负整数。数字最高位位于链表开始位置。它们的每个节点只存储一位数字。将这两数相加会返回一个新的链表。

你可以假设除了数字 0 之外，这两个数字都不会以零开头。

&nbsp;

示例1：

<img alt="" src="https://pic.leetcode.cn/1626420025-fZfzMX-image.png" style="width: 302px; " />

<pre>
输入：l1 = [7,2,4,3], l2 = [5,6,4]
输出：[7,8,0,7]
</pre>

示例2：

<pre>
输入：l1 = [2,4,3], l2 = [5,6,4]
输出：[8,0,7]
</pre>

示例3：

<pre>
输入：l1 = [0], l2 = [0]
输出：[0]
</pre>

&nbsp;

提示：

<ul>
	<li>链表的长度范围为<code> [1, 100]</code></li>
	<li><code>0 &lt;= node.val &lt;= 9</code></li>
	<li>输入数据保证链表代表的数字无前导 0</li>
</ul>

&nbsp;

进阶：如果输入链表不能翻转该如何解决？