1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-18 11:36:48 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 12:43:11 +08:00
parent 58bbdfd57c
commit 2b0511d272
10721 changed files with 8123 additions and 8119 deletions

View File

@@ -0,0 +1,21 @@
<p>给定两个用链表表示的整数,每个节点包含一个数位。</p>
<p>这些数位是反向存放的,也就是个位排在链表首部。</p>
<p>编写函数对这两个整数求和,并用链表形式返回结果。</p>
<p>&nbsp;</p>
<p><strong>示例:</strong></p>
<pre><strong>输入:</strong>(7 -&gt; 1 -&gt; 6) + (5 -&gt; 9 -&gt; 2)即617 + 295
<strong>输出:</strong>2 -&gt; 1 -&gt; 9即912
</pre>
<p><strong>进阶:</strong>思考一下,假设这些数位是正向存放的,又该如何解决呢?</p>
<p><strong>示例:</strong></p>
<pre><strong>输入:</strong>(6 -&gt; 1 -&gt; 7) + (2 -&gt; 9 -&gt; 5)即617 + 295
<strong>输出:</strong>9 -&gt; 1 -&gt; 2即912
</pre>