237. Delete Node in a Linked List

发表于 | 分类于 ， | 阅读次数:

Total Accepted: 61181
Total Submissions: 139905
Difficulty: Easy

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.

标准写当然需要delete了，不标准的话就直接*node=node->next；即可

C++:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
/**
 * 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 *next = node->next;
        *node = *next;
        delete next;
    }
};

打个小广告

欢迎加入我的小专栏「基你太美」一起学习。