/
solution.ts
44 lines (41 loc) · 1.38 KB
/
solution.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Math #Linked_List #Recursion
// #Data_Structure_II_Day_10_Linked_List #Programming_Skills_II_Day_15
// #Big_O_Time_O(max(N,M))_Space_O(max(N,M)) #2023_09_28_Time_92_ms_(77.86%)_Space_48_MB_(69.29%)
import { ListNode } from '../../com_github_leetcode/listnode'
/*
* Definition for singly-linked list.
* class ListNode {
* val: number
* next: ListNode | null
* constructor(val?: number, next?: ListNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function addTwoNumbers(l1: ListNode | null, l2: ListNode | null): ListNode | null {
const dummyHead: ListNode = new ListNode(0)
let p: ListNode | null = l1
let q: ListNode | null = l2
let curr: ListNode | null = dummyHead
let carry: number = 0
while (p !== null || q !== null) {
const x: number = p !== null ? p.val : 0
const y: number = q !== null ? q.val : 0
const sum: number = carry + x + y
carry = Math.floor(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
}
export { addTwoNumbers }