---
title: 'LeetCode 237. Delete Node in a Linked List'
disqus: hackmd
---

# LeetCode 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.

## Example

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.

## 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

## Answer

此題可直接把下一個node的值跟next address拿來用即可，並free掉下一個點，用自身代替下個點。

//2022_03_12
void deleteNode(struct ListNode* node){
    struct ListNode *del = node->next;
    node->val = del->val;
    node->next = del->next;
    free(del);
}

## Link
https://leetcode.com/problems/delete-node-in-a-linked-list/
###### tags: `Leetcode`