LeetCode //C - 237. Delete Node in a Linked List

237. Delete Node in a Linked List

There is a singly-linked list head and we want to delete a node node in it.

You are given the node to be deleted node. You will not be given access to the first node of head.

All the values of the linked list are unique, and it is guaranteed that the given node node is not the last node in the linked list.

Delete the given node. Note that by deleting the node, we do not mean removing it from memory. We mean:

  • The value of the given node should not exist in the linked list.
  • The number of nodes in the linked list should decrease by one.
  • All the values before node should be in the same order.
  • All the values after node should be in the same order.

Custom testing:

  • For the input, you should provide the entire linked list head and the node to be given node. node should not be the last node of the list and should be an actual node in the list.
  • We will build the linked list and pass the node to your function.
  • The output will be the entire list after calling your function.
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.

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.

From: LeetCode

Link: 237. Delete Node in a Linked List


Solution:

Ideas:
  • Check for edge cases: The function first checks if the node to be deleted is NULL or if it is the last node. If either condition is true, the function returns immediately since it is not possible to delete the last node or a NULL node with this approach.
  • Copy the next node's value: The value of the next node is copied to the given node.
  • Link to the next of next node: The next pointer of the given node is updated to skip the next node, effectively linking to the node after the next node.
  • Free the next node: The memory of the next node (which is now redundant) is freed.
Code:
c 复制代码
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
void deleteNode(struct ListNode* node) {
    if (node == NULL || node->next == NULL) {
        return; // Cannot delete if the node is NULL or it is the last node
    }
    
    struct ListNode* nextNode = node->next;
    node->val = nextNode->val;
    node->next = nextNode->next;
    free(nextNode); // Free the memory of the next node
}
相关推荐
努力学习的小廉32 分钟前
深入了解linux系统—— 线程同步
linux·服务器·数据库·算法
数据爬坡ing35 分钟前
从挑西瓜到树回归:用生活智慧理解机器学习算法
数据结构·深度学习·算法·决策树·机器学习
luoganttcc36 分钟前
小鹏汽车 vla 算法最新进展和模型结构细节
人工智能·算法·汽车
云:鸢2 小时前
C语言链表设计及应用
c语言·开发语言·数据结构·链表
wallflower20202 小时前
滑动窗口算法在前端开发中的探索与应用
前端·算法
林木辛2 小时前
LeetCode热题 42.接雨水
算法·leetcode
MicroTech20252 小时前
微算法科技(NASDAQ: MLGO)采用量子相位估计(QPE)方法,增强量子神经网络训练
大数据·算法·量子计算
星梦清河2 小时前
宋红康 JVM 笔记 Day15|垃圾回收相关算法
jvm·笔记·算法
货拉拉技术2 小时前
揭秘语音交互的核心技术
算法
矛取矛求3 小时前
日期类的实现
开发语言·c++·算法