[leetcode] 237. Delete Node in a Linked List 解题报告

题目链接：https://leetcode.com/problems/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) {
        ListNode* tem = node->next;
        swap(node->val, tem->val);
        node->next = tem->next;
        delete tem;
    }
};