leetcode_237 topic--delete Node in a Linked list (linked list)

Delete Node in a Linked ListTotal accepted:6113 Total submissions:12798my submissions QuestionSolution

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 1 -> 2 -> 3 -> 4 is and you were given the third node with value 3 , the linked list should become 1 -> 2 -> 4 a Fter calling your function.

Hide TagsLinked ListHide Similar Problems(E) Remove Linked List Elementsparsing: This problem needs to delete the linked list node, but the value let you know the need to delete the node, so, can only be the back of the number to the front assignment, (the topic has been said to be deleted must not be the last node, otherwise it will not be done)

#include <iostream>using namespace std; struct ListNode {      int val;      ListNode *next;      ListNode (int x): Val (x), Next (NULL) {}};void Deletenode (listnode* node) {if (node==null) return; listnode* Ptr1=node; listnode* ptr2=node->next; listnode* Ptr3=ptr2->next;while (1) {ptr1->val=ptr2->val;if (ptr3==null) break;ptr1=ptr1->next;ptr2= Ptr2->next;ptr3=ptr3->next;} Ptr1->next=null;return;} int main () {listnode* root=null;root=new listnode (0); root->next=new listnode (1);d eletenode (root);}

　　

leetcode_237 topic--delete Node in a Linked list (linked list)