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.
因为题目说了不会是尾节点,而且只给当前节点的pointer,所以考虑把当前节点的值和下一个节点交换然后删除下一个节点。
/**
* 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 == NULL || node->next == NULL) return ;
ListNode *n = node->next;
int temp = n->val;
n->val = node->val;
node->val = temp;
node->next = n->next;
}
};