Class Solution

java.lang.Object
g0001_0100.s0002_add_two_numbers.Solution

public class Solution extends Object
2 - Add Two Numbers.<p>Medium</p> <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> <p>You may assume the two numbers do not contain any leading zero, except the number 0 itself.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg" alt="" /></p> <p><strong>Input:</strong> l1 = [2,4,3], l2 = [5,6,4]</p> <p><strong>Output:</strong> [7,0,8]</p> <p><strong>Explanation:</strong> 342 + 465 = 807.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> l1 = [0], l2 = [0]</p> <p><strong>Output:</strong> [0]</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]</p> <p><strong>Output:</strong> [8,9,9,9,0,0,0,1]</p> <p><strong>Constraints:</strong></p> <ul> <li>The number of nodes in each linked list is in the range <code>[1, 100]</code>.</li> <li><code>0 <= Node.val <= 9</code></li> <li>It is guaranteed that the list represents a number that does not have leading zeros.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details