https://github.com/emahtab/add-two-numbers
Add two linked lists nodes
https://github.com/emahtab/add-two-numbers
leetcode linked-list problem-solving
Last synced: 3 months ago
JSON representation
Add two linked lists nodes
- Host: GitHub
- URL: https://github.com/emahtab/add-two-numbers
- Owner: eMahtab
- Created: 2020-05-02T00:29:17.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2020-05-02T00:31:30.000Z (about 5 years ago)
- Last Synced: 2025-02-02T03:26:23.720Z (5 months ago)
- Topics: leetcode, linked-list, problem-solving
- Homepage:
- Size: 1.95 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Add Two Numbers
## https://leetcode.com/problems/add-two-numbers
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 contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
```
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
```
# Implementation :
```java
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0);
ListNode p = l1, q = l2, curr = dummyHead;
int carry = 0;
while (p != null || q != null) {
int x = (p != null) ? p.val : 0;
int y = (q != null) ? q.val : 0;
int sum = carry + x + y;
carry = sum / 10;
curr.next = new ListNode(sum % 10);
curr = curr.next;
if (p != null)
p = p.next;
if (q != null)
q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
}
}
```
# References :
1. https://www.youtube.com/watch?v=aM4Iv7eEr2o
2. https://leetcode.com/articles/add-two-numbers