typescript-leetcode/mediumChallenges/deleteNodesFromLinkedListPresentInArray.ts at main · yandevv/typescript-leetcode · GitHub

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
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
// 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 modifiedList(nums: number[], head: ListNode | null): ListNode | null {
	const removedNumbers = new Set(nums);

	while(removedNumbers.has(head!.val)) {
		head = head!.next;
	}

	let lastNode = head;
	let actualNode = head?.next;
	while(actualNode) {
		if(removedNumbers.has(actualNode.val)) {
			lastNode!.next = actualNode.next;
			actualNode = actualNode.next;
			continue;
		}

		lastNode = actualNode;
		actualNode = actualNode.next;
	}

	return head;
};

const case1Head = new ListNode(
	1,
	new ListNode(
		2,
		new ListNode(
			3,
			new ListNode(
				4,
				new ListNode(5)
			)
		)
	)
);
const case1 = modifiedList([1,2,3], case1Head);

const case2Head = new ListNode(
	1,
	new ListNode(
		2,
		new ListNode(
			1,
			new ListNode(
				2,
				new ListNode(
					1,
					new ListNode(2)
				)
			)
		)
	)
);
const case2 = modifiedList([1], case2Head);

const case3Head = new ListNode(
	1,
	new ListNode(
		2,
		new ListNode(
			3,
			new ListNode(4)
		)
	)
);
const case3 = modifiedList([5], case3Head);

console.log(`case1:`);
console.log(case1);
console.log(`case2:`);
console.log(case2);
console.log(`case3:`);
console.log(case3);