- Singly-linked List(Easy)
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
- 237. Delete Node in a Linked Lis
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.
先看代码
class Solution {
public:
void deleteNode(ListNode* node) {
*node = *node->next;
}
};
分析总结
题目的意思是删除链表中一个节点，并且给了一个指向这个节点的指针。
但是大神的代码只有一行。。。。。。。如何分析？
简单来看，node就是要删除的节点，node->next就是要删除的节点的下一个节点，这句代码的意思把下一个节点复制给要删除的节点。
让我们画个图形象生动地说明一下~
图形
怎么样，是不是很形象生动？
PS：有些童鞋说节点并没有被删掉，但是，它确实是从链表中删除了啊~
网友评论