problem:
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.
主要是这样想的,这道题目直接给出了被删除节点的位置(仅仅这个条件已知),之前删除一个节点是必须知道删除节点之前的位置,这样的话才能删,这道题目,我想应该把这个被删的节点当作删除节点之前的那个节点,把后一个节点的内容复制到这个节点,删除后一个节点就好了。
solution:
/**
* 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)
{
node->val=node->next->val;
ListNode *tmp=node->next;
node->next=tmp->next;
delete tmp;
}
};