237. 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.

题目链接：

---

思路分析

只给一个链表的结点，删除这个结点。

这道题目被喷惨了，因为实在是很无厘头，AC方法是将node指针直接赋值为下一个。

代码

递归

/**
 * 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 = *node->next;
    }
};

时间复杂度：$O(1)$
空间复杂度：$O(1)$

---

反思

对于指针的使用，还需要学习。