leetcode_delete_node_in_a_linked_list

发表于

难度：Easy

代码：

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

运行结果：13ms，超过23.22%