https://github.com/raj-roy/leetcode-add-two-numbers

https://github.com/raj-roy/leetcode-add-two-numbers

csharp csharp-code leetcode leetcode-csharp leetcode-solutions solution

Last synced: 27 days ago
JSON representation

• Host: GitHub
• URL: https://github.com/raj-roy/leetcode-add-two-numbers
• Owner: raj-roy
• License: mit
• Created: 2024-11-07T04:38:03.000Z (3 months ago)
• Default Branch: dev
• Last Pushed: 2024-11-07T06:09:14.000Z (3 months ago)
• Last Synced: 2024-11-07T06:32:39.320Z (3 months ago)
• Topics: csharp, csharp-code, leetcode, leetcode-csharp, leetcode-solutions, solution
• Language: C#
• Homepage:
• Size: 5.86 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Add Two Numbers

## Porblem Statement

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, 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.

 

## Explanation

**Example 1:**

**Input**: 

L1 = [2,4,3], 

L2 = [5,6,4]




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

Explanation: 342 + 465 = 807.




**Example 2:**

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

**Output**: [0]




**Example** 3:

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

**Output**: [8,9,9,9,0,0,0,1]

 

### 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.