题目:
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.
题意:
给定一个链表中的节点,删除该节点。该节点不是tail节点。
思路:
将被删除的节点中保存该节点后一个节点的值,然后删除后一个节点即可。
代码如下:
/**
* 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 || node->next == NULL)return;
node->val = node->next->val;
ListNode* tmp = node->next;
node->next = node->next->next;
delete tmp;
}
};