Leetcode #237 Delete Node in a Linked List

最新推荐文章于 2021-06-08 03:03:12 发布

原创最新推荐文章于 2021-06-08 03:03:12 发布 · 356 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种在单链表中删除指定节点的方法，不使用头指针的情况下仅通过给定节点来操作。

Delete Node in a Linked List

My Submissions

Total Accepted: 46246 Total Submissions: 104863 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 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.

Subscribe to see which companies asked this question

void deleteNode(ListNode* node) {

	if(node->next == NULL)
	{
		node = NULL;
		return ;
	}
	node->val = node->next->val;
	node->next = node->next->next;

}

把后一个元素值换到该点node上，然后删除node->next的元素