# 0237. Delete Node in a Linked List

<https://leetcode.com/problems/delete-node-in-a-linked-list>

## Description

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:**

![](https://assets.leetcode.com/uploads/2020/09/01/node1.jpg)

```
**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:**

![](https://assets.leetcode.com/uploads/2020/09/01/node2.jpg)

```
**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]
```

**Constraints:**

* The number of the nodes in the given list is in the range `[2, 1000]`.
* `-1000 <= Node.val <= 1000`
* The value of each node in the list is **unique**.
* The `node` to be deleted is **in the list** and is **not a tail** node

## ac1: walk through

```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) {
        // edge cases
        if (node == null || node.next == null) return;

        ListNode nxt = node.next;
        while (nxt != null) {
            node.val = nxt.val;
            nxt = nxt.next;
            if (nxt != null) node = node.next;
        }
        node.next = null;
    }
}
```

## ac2: change one node

```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) {
        // edge cases
        if (node == null || node.next == null) return;

        node.val = node.next.val;
        node.next = node.next.next;
    }
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://jaywin.gitbook.io/leetcode/solutions/0237-delete-node-in-a-linked-list.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.