forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.ts
44 lines (43 loc) · 1018 Bytes
/
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
/**
* 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 {
if (l1 == null || l2 == null) {
return l1 && l2;
}
const dummy = new ListNode(0);
let cur = dummy;
while (l1 != null || l2 != null) {
let val = 0;
if (l1 != null) {
val += l1.val;
l1 = l1.next;
}
if (l2 != null) {
val += l2.val;
l2 = l2.next;
}
if (cur.val >= 10) {
cur.val %= 10;
val++;
}
cur.next = new ListNode(val);
cur = cur.next;
}
if (cur.val >= 10) {
cur.val %= 10;
cur.next = new ListNode(1);
}
return dummy.next;
}