• Home
• com.github.javadev
• leetcode-in-java
• 1.33
• source code
• readme.md

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

g0401_0500.s0445_add_two_numbers_ii.readme.md Maven / Gradle / Ivy

445\. Add Two Numbers II

Medium

You are given two **non-empty** 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/04/09/sumii-linked-list.jpg)

**Input:** l1 = [7,2,4,3], l2 = [5,6,4]

**Output:** [7,8,0,7] 

**Example 2:**

**Input:** l1 = [2,4,3], l2 = [5,6,4]

**Output:** [8,0,7] 

**Example 3:**

**Input:** l1 = [0], l2 = [0]

**Output:** [0] 

**Constraints:**

*   The number of nodes in each linked list is in the range `[1, 100]`.
*   `0 <= Node.val <= 9`
*   It is guaranteed that the list represents a number that does not have leading zeros.

**Follow up:** Could you solve it without reversing the input lists?