Leetcode: Delete Node in a Linked List


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.

比较水的题，有点投机取巧。直接把值替换一下。

/**
* 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 == nullptr || node->next == nullptr) {
return;
}

node->val = node->next->val;
node->next = node->next->next;
}
};