leetcode 237. Delete Node in a Linked List

最新推荐文章于 2022-10-13 10:32:50 发布

huanghanqian

最新推荐文章于 2022-10-13 10:32:50 发布

阅读量261

点赞数

分类专栏： leetcode leetcode

本文链接：https://blog.csdn.net/huanghanqian/article/details/74196308

版权

leetcode 同时被 2 个专栏收录

261 篇文章 1 订阅

订阅专栏

leetcode

257 篇文章 17 订阅

订阅专栏

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.

一开始我没看懂题目。这道题的意思是说，比如一条链表是1->2->3->4，那么我的输入是3这个结点，你需要把3这个结点从整个链表中去除。数据结构课作业写过，so easy.

package leetcode;

public class Delete_Node_in_a_Linked_List_237 {

	public void deleteNode(ListNode node) {
		node.val=node.next.val;
		node.next=node.next.next;
	}

}