Package g0401_0500.s0445_add_two_numbers_ii

Class Solution

java.lang.Object

g0401_0500.s0445_add_two_numbers_ii.Solution

public class Solution
extends Object

445 - Add Two Numbers II.<p>Medium</p> <p>You are given two <strong>non-empty</strong> 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.</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/2021/04/09/sumii-linked-list.jpg" alt="" /></p> <p><strong>Input:</strong> l1 = [7,2,4,3], l2 = [5,6,4]</p> <p><strong>Output:</strong> [7,8,0,7]</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> l1 = [2,4,3], l2 = [5,6,4]</p> <p><strong>Output:</strong> [8,0,7]</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> l1 = [0], l2 = [0]</p> <p><strong>Output:</strong> [0]</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> <p><strong>Follow up:</strong> Could you solve it without reversing the input lists?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
ListNode	addTwoNumbers(ListNode l1, ListNode l2)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

addTwoNumbers

public ListNode addTwoNumbers(ListNode l1,
 ListNode l2)