Java for LeetCode 237 Delete Node in a Linked List

public class Solution {
    public void deleteNode(ListNode node) {
        if(node==null||node.next==null)
        	return;
        node.val = node.next.val;
        node.next = node.next.next;  

    }
}

时间： 2024-12-14 18:42:48

Java for LeetCode 237 Delete Node in a Linked List的相关文章

leetCode 237. Delete Node in a Linked List 链表

237. Delete Node in a Linked List 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, the linked

leetcode:237 Delete Node in a Linked List－每日编程第四题

Delete Node in a Linked List Total Accepted: 47385 Total Submissions: 107608 Difficulty: Easy 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 ->

LeetCode (237):Delete Node in a Linked List

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, the linked list should become 1 -> 2 ->

[leetcode] 237. Delete Node in a Linked List 解题报告

[LeetCode] 237. Delete Node in a Linked List 解题思路

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

翻译给定一个访问节点的路径,写一个函数去删除在一个单向链表中除尾部以外的节点. 假设这个链表是1 -> 2 -> 3 -> 4,并且你被给予了第3个值为3的节点,那么在调用你的函数之后这个链表应该变为1 -> 2 -> 4. 原文 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the l

(easy)LeetCode 237.Delete Node in a Linked List

leetcode 237 Delete Node in a Linked List python

题目: 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, the linked list should become 1 -> 2 -

237. Delete Node in a Linked List（C++）

237. Delete Node in a Linked Lis t 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, the linked