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 -> 4after calling your function.
删除一个指定节点，只给你要删除的那个节点。
将下一个点的值复制过来，然后修改一下指针。
数据好像不太严谨，如果不判断下一个不存在的情况也能过。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
void deleteNode(ListNode* node) {
if(!node->next)
{
delete node;
return ;
}
node->val = node->next->val;
node->next = node->next->next;
}
};
转载请注明原文地址: https://ju.6miu.com/read-668815.html
