Skip to content

Commit 7e33d11

Browse files
committed
remove-nth-node-from-end-of-list solution
1 parent e126680 commit 7e33d11

File tree

1 file changed

+40
-0
lines changed

1 file changed

+40
-0
lines changed
Lines changed: 40 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,40 @@
1+
/**
2+
* https://leetcode.com/problems/remove-nth-node-from-end-of-list/submissions/1672151418/
3+
* Definition for singly-linked list.
4+
* function ListNode(val, next) {
5+
* this.val = (val===undefined ? 0 : val)
6+
* this.next = (next===undefined ? null : next)
7+
* }
8+
*/
9+
/**
10+
* @param {ListNode} head
11+
* @param {number} n
12+
* @return {ListNode}
13+
*/
14+
var removeNthFromEnd = function (head, n) {
15+
// dummy 노드를 만들어 head 앞에 두기 (edge case: 첫 번째 노드를 제거할 때 편리)
16+
let dummy = new ListNode(0);
17+
dummy.next = head;
18+
19+
// fast와 slow 포인터를 dummy에서 시작
20+
let fast = dummy;
21+
let slow = dummy;
22+
23+
// fast 포인터를 n+1 만큼 앞으로 이동시킴
24+
// (slow가 제거 노드의 바로 이전 노드에 멈추도록 하기 위함)
25+
for (let i = 0; i < n + 1; i++) {
26+
fast = fast.next;
27+
}
28+
29+
// fast와 slow를 함께 끝까지 이동
30+
while (fast !== null) {
31+
fast = fast.next;
32+
slow = slow.next;
33+
}
34+
35+
// slow.next가 제거할 노드이므로, 그 노드를 skip
36+
slow.next = slow.next.next;
37+
38+
// dummy.next가 새 head
39+
return dummy.next;
40+
};

0 commit comments

Comments
 (0)