mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
40 lines
1.2 KiB
HTML
40 lines
1.2 KiB
HTML
|
<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p>
|
|||
|
|
|
|||
|
|
<p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p>
|
|||
|
|
|
|||
|
|
<p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>示例 1：</strong></p>
|
|||
|
|
<img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2021/01/02/addtwonumber1.jpg" style="width: 483px; height: 342px;" />
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]
|
|||
|
|
<strong>输出：</strong>[7,0,8]
|
|||
|
|
<strong>解释：</strong>342 + 465 = 807.
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 2：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>l1 = [0], l2 = [0]
|
|||
|
|
<strong>输出：</strong>[0]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p><strong>示例 3：</strong></p>
|
|||
|
|
|
|||
|
|
<pre>
|
|||
|
|
<strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
|
|||
|
|
<strong>输出：</strong>[8,9,9,9,0,0,0,1]
|
|||
|
|
</pre>
|
|||
|
|
|
|||
|
|
<p> </p>
|
|||
|
|
|
|||
|
|
<p><strong>提示：</strong></p>
|
|||
|
|
|
|||
|
|
<ul>
|
|||
|
|
<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>
|
|||
|
|
<li><code>0 <= Node.val <= 9</code></li>
|
|||
|
|
<li>题目数据保证列表表示的数字不含前导零</li>
|
|||
|
|
</ul>
|