# LeetCode237. Delete Node in a Linked List（模拟 / 链表）

## LeetCode237. Delete Node in a Linked List（模拟 / 链表）

• Easy
• Accepted：265,570
• Submissions：510,572

Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.

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.

### 代码

Time SubmittedStatusRuntimeMemoryLanguage
a few seconds agoAccepted20 ms9.2 MBcpp
2 minutes agoAccepted12 ms9.3 MBcpp
// 12 ms

class Solution {
public:
void deleteNode(ListNode* node) {
node->val = node->next->val; // 保存下一个结点的信息
node->next = node->next->next; // “删除下一个结点”
}
};
// 20ms

class Solution {
public:
void deleteNode(ListNode* node) {
ListNode* next = node->next;
node->val = next->val;
node->next = next->next;
delete next;
}
};

void deleteNode(ListNode* node) {
*node = *node->next;
}

The end.
2019年3月4日 星期一