-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path19. Remove Nth Node From End of List.ts
64 lines (57 loc) · 1.43 KB
/
19. Remove Nth Node From End of List.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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
/**
* 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)
* }
* }
*/
{
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 removeNthFromEnd(head: ListNode | null, n: number): ListNode | null {
let currentNode = head;
if (n === 1 && currentNode) {
while (currentNode && currentNode.next && currentNode.next.next) {
currentNode = currentNode.next;
}
if (currentNode.next) {
currentNode.next = currentNode.next.next;
} else {
return null;
}
return head;
}
let size = 0;
while (currentNode && (currentNode.val === 0 || currentNode.val)) {
size++;
currentNode = currentNode.next;
}
if (size <= 1) {
return null;
}
if (size - n - 1 < 0 && head) {
head = head.next;
return head;
}
let prevNode = head;
for (let i = 0; i < size - n - 1; i++) {
if (prevNode) {
prevNode = prevNode.next;
}
}
if (prevNode && prevNode.next) {
prevNode.next = prevNode.next.next
}
return head;
};
}