每天一道LeetCode--237.Delete Node in a Linked List
Posted 华裳绕指柔
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了每天一道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 -> 4
after calling your function.
package cn.magicdu; import cn.magicdu.extra.ListNode; public class _237_Delete_Node_in_a_Linked_List { public void deleteNode(ListNode node) { node.val = node.next.val; node.next = node.next.next; } }
以上是关于每天一道LeetCode--237.Delete Node in a Linked List的主要内容,如果未能解决你的问题,请参考以下文章
[Leetcode]237. Delete Node in a Linked List
[LeetCode]237. Delete Node in a Linked List
[LeetCode] 237. Delete Node in a Linked List
LeetCode 237. Delete Node in a Linked List