【leetcode】【easy】237. Delete Node in a Linked List

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.

Given linked list -- head = [4,5,1,9], which looks like following:

 

Example 1:

Input: head = [4,5,1,9], node = 5
Output: [4,1,9]
Explanation: You are given the second node with value 5, the linked list should become 4 -> 1 -> 9 after calling your function.

Example 2:

Input: head = [4,5,1,9], node = 1
Output: [4,5,9]
Explanation: You are given the third node with value 1, the linked list should become 4 -> 5 -> 9 after calling your function.

Note:

• The linked list will have at least two elements.
• All of the nodes' values will be unique.
• The given node will not be the tail and it will always be a valid node of the linked list.
• Do not return anything from your function.

题目链接：https://leetcode.com/problems/delete-node-in-a-linked-list/

思路

一道脑经急转弯题。

只能获取删除元素，立刻想到的是类似有序数组里删除操作，将后面的元素值依次向前移动。再仔细想想只需要移动依次，后面可以利用直接修改节点的链接关系来完成。

第一个if用来判别输入的合法性，第二个if用来对付删除元素位于链尾的情况（本题排声明排除了这个情况）。

/**
 * 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) return;
        if(node->next == NULL){
            delete node;
            node = NULL;
            return;
        }
        auto tmp = node->next;
        node->val = tmp->val;
        node->next = tmp->next;
        delete tmp;
        return;
    }
};