LeetCode 237. Delete Node in a Linked List

最新推荐文章于 2024-11-05 21:58:11 发布

s_h_r

最新推荐文章于 2024-11-05 21:58:11 发布

阅读量355

点赞数

分类专栏： LeetCode 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/s_h_r/article/details/50651180

版权

LeetCode 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

题意：给你一个单向链表，删除一个非末节点。

class Solution {
public:
    void deleteNode(ListNode* node) {
        if(node == NULL || node->next == NULL)
            return;
        node->val = node->next->val;
        node->next = node->next->next;
    }
};

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

s_h_r

关注关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
复制链接

分享到 QQ

分享到新浪微博

扫一扫

专栏目录

Leetcode 237. Delete Node in a Linked List-删除链表的指定节点，不给链表的头节点

Top5软件工程硕士，先后在京东、字节从事多年Java后端开发、实时和离线大数据开发

04-05

843

Write a function todelete a nodein a singly-linked list. You willnotbe given access to theheadof the list, instead you will be given access tothe node to be deleteddirectly. It isguaranteedthat the node to be deleted isnot a tail nodein the li...

leetcode 237. Delete Node in a Linked List（链表中删除节点）

蓝羽飞鸟的博客

10-13

294

leetcode 237

参与评论您还未登录，请先登录后发表或查看评论

Leetcode 237. Delete Node in a Linked List

GoodJobJasper的博客

12-27

199

方法1: 这题目被踩的很厉害，但是对于我来说还是学到点东西的。这题我让我知道了要彻底删除一个节点需要知道头节点，lc给出的做法其实就是修改这个node的值，修改这个node的去向。其实就是把要删除的node易容成了它的下一个节点，但是本身并没有删除。时间1，空间1. /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNod.

leetcode237. Delete Node in a Linked List

中华小当家的博客

02-28

题目描述 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], which looks like following: Example 1: Input: he...

leetcode 237. Delete Node in a Linked List

djph26741的博客

03-30

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third...

LeetCode237. Delete Node in a Linked List

李歇特冯-兹拜因巴哈的博客

05-07

123

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], which looks like following: Example 1: Inpu...

Leetcode 237. Delete Node in a Linked List (Java)

weixin_58080442的博客

03-22

166

237. Delete Node in a Linked List

wilzxu的博客

03-04

116

237. Delete Node in a Linked List易错点：易错点：顺序 class Solution { public: void deleteNode(ListNode* node) { if (!node) return; ListNode* prev = nullptr; while (node -> next...

LeetCode 237. Delete Node in a Linked List【链表】简单

memcpy0的博客

08-23

315

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] , which looks like following: Example 1: Input: head = [4,5,1,9], node = 5 Output: [4,1,9] Explanation: You a

python-leetcode题解之237-Delete-Node-in-a-Linked-List.py

09-12

python python_leetcode题解之237_Delete_Node_in_a_Linked_List.py

leetcode不会-delete-node-in-a-linked-list:删除链表中的节点

06-30

leetcode 不会删除链表中的节点编写一个函数来删除单向链表中的节点（尾部除外），只允许访问该节点。给定链表——head = [4,5,1,9]。 Example 1: Input: head = [4,5,1,9], node = 5 Output: [4,1,9] Explanation...

LeetCode每日一题(237. Delete Node in a Linked List)

wangjun861205的博客

10-13

378

一开始我也觉得这题出错了，我们无法拿到要删除节点的上一个节点。但是按照官方 solution 的说法，我们可以“假装”删掉当前节点，怎么假装呢，就是我们把当前节点的 Val 改成它的 Next 的 Val，然后把 Next 删掉, 这样的效果就跟删掉当前节点一样了。这次用golang实现的， rust实现可能只能用unsafe了， leetcode压根就没给准备模板。这题有点旱路不走走水路的意思。

[LeetCode]--237. Delete Node in a Linked List

杜鲁门的博客

10-14

625

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, t

抓住问题的关键解决LeetCode第3337题字符串转换后的长度II

2302_79682652的博客

11-04

528

将s[i]替换为字母表中后续的nums[s[i]-'a']个连续字符。例如，如果s[i]='y'且nums[24]=3，则字符'y'转换为它后面的3个连续字符，结果为"zab"。输入：s="abcyy",t=2,nums=[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2]输入：s="azbk",t=1,nums=[2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2]

Leetcode 62. 不同路径动态规划+空间优化

想买很多漂亮衣服但是买不起的博客

11-01

311

【代码】Leetcode 62. 不同路径动态规划+空间优化。

【LeetCode】【算法】160.相交链表