-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdeleteNodeinaLinkedList.js
More file actions
42 lines (41 loc) · 1.46 KB
/
deleteNodeinaLinkedList.js
File metadata and controls
42 lines (41 loc) · 1.46 KB
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
////////////////////////////////////////////////Delete Node in a Linked List///////////////////////////////////////////
// Write a function to delete a node in a singly-linked list. You will not be given access to the head of the list, instead
// you will be given access to the node to be deleted directly.
// It is guaranteed that the node to be deleted is not a tail node in the list.
// Example 1:
// Input: head = [4,5,1,9], node = 5
// Output: [4,1,9]
// Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.
// Example 2:
// Input: head = [4,5,1,9], node = 1
// Output: [4,5,9]
// Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.
// Example 3:
// Input: head = [1,2,3,4], node = 3
// Output: [1,2,4]
// Example 4:
// Input: head = [0,1], node = 0
// Output: [1]
// Example 5:
// Input: head = [-3,5,-99], node = -3
// Output: [5,-99]
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} node
* @return {void} Do not return anything, modify node in-place instead.
*/
const deleteNode2 = function(node) {
node.val = node.next.val;
node.next = node.next.next;
};
// console.log(deleteNode2(5));
// console.log(deleteNode2(1));
// console.log(deleteNode2(3));
// console.log(deleteNode2(0));
// console.log(deleteNode2(-3));