https://github.com/emahtab/delete-node-in-a-linked-list
Delete node in a linked list
https://github.com/emahtab/delete-node-in-a-linked-list
leetcode linked-list problem-solving
Last synced: 3 months ago
JSON representation
Delete node in a linked list
- Host: GitHub
- URL: https://github.com/emahtab/delete-node-in-a-linked-list
- Owner: eMahtab
- Created: 2020-04-16T18:19:33.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2020-06-04T07:21:23.000Z (about 5 years ago)
- Last Synced: 2025-02-02T03:26:10.590Z (5 months ago)
- Topics: leetcode, linked-list, problem-solving
- Size: 3.91 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Delete node in a linked list
## https://leetcode.com/problems/delete-node-in-a-linked-list
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
Given linked list -- head = [4,5,1,9].
```
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.
```
**Note:**
1. The linked list will have at least two elements.
2. All of the nodes' values will be unique.
3. The given node will not be the tail and it will always be a valid node of the linked list.
4. Do not return anything from your function.
# Implementation :
```java
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public void deleteNode(ListNode node) {
node.val = node.next.val;
node.next = node.next.next;
}
}
```
### Important :
We are given that initially there will be at least 2 nodes in the linked list, and we won't be deleting tail node. Which means `node.next` will not be null.
# References :
https://leetcode.com/articles/delete-node-linked-list