237. Delete Node in a Linked List, nodelinked

237. Delete Node in a Linked List, nodelinked

Write a function to delete a node (cannot the tail) in a singly linked list, given only access to that node.

Supposed the linked list is1-> 2-> 3-> 4And you are given the third node with value3, The linked list shoshould become1-> 2-> 4After calling your function.

 

1/** 2 * Definition for singly-linked list. 3 * struct ListNode {4 * int val; 5 * struct ListNode * next; 6 *}; 7 */8 void deleteNode (struct ListNode * node) {9 if (node = NULL | node-> next = NULL) 10 return; 11 node-> val = node-> next-> val; // assign the next node value to delete the current node 12 node-> next = node-> next; // Delete the next node 13}