---
# System prepended metadata

title: Question 237. Delete Node in a Linked List
tags: [leetcode]

---

###### tags: `leetcode`
# Question 237. 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.

### Solution:
```
Change node's value without delete it.
```
### AC code
```cpp=
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    void deleteNode(ListNode* node) {
        *node = *(node->next);
    }
};
```