|
| 1 | +<h2><a href="https://leetcode.com/problems/add-two-numbers">Add Two Numbers</a></h2> <img src='https://img.shields.io/badge/Difficulty-Medium-orange' alt='Difficulty: Medium' /><hr><p>You are given two <strong>non-empty</strong> linked lists representing two non-negative integers. The digits are stored in <strong>reverse order</strong>, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.</p> |
| 2 | + |
| 3 | +<p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.</p> |
| 4 | + |
| 5 | +<p> </p> |
| 6 | +<p><strong class="example">Example 1:</strong></p> |
| 7 | +<img alt="" src="https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg" style="width: 483px; height: 342px;" /> |
| 8 | +<pre> |
| 9 | +<strong>Input:</strong> l1 = [2,4,3], l2 = [5,6,4] |
| 10 | +<strong>Output:</strong> [7,0,8] |
| 11 | +<strong>Explanation:</strong> 342 + 465 = 807. |
| 12 | +</pre> |
| 13 | + |
| 14 | +<p><strong class="example">Example 2:</strong></p> |
| 15 | + |
| 16 | +<pre> |
| 17 | +<strong>Input:</strong> l1 = [0], l2 = [0] |
| 18 | +<strong>Output:</strong> [0] |
| 19 | +</pre> |
| 20 | + |
| 21 | +<p><strong class="example">Example 3:</strong></p> |
| 22 | + |
| 23 | +<pre> |
| 24 | +<strong>Input:</strong> l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9] |
| 25 | +<strong>Output:</strong> [8,9,9,9,0,0,0,1] |
| 26 | +</pre> |
| 27 | + |
| 28 | +<p> </p> |
| 29 | +<p><strong>Constraints:</strong></p> |
| 30 | + |
| 31 | +<ul> |
| 32 | + <li>The number of nodes in each linked list is in the range <code>[1, 100]</code>.</li> |
| 33 | + <li><code>0 <= Node.val <= 9</code></li> |
| 34 | + <li>It is guaranteed that the list represents a number that does not have leading zeros.</li> |
| 35 | +</ul> |
0 commit comments