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.
- 当结点next指针为NULL时,即当前结点为tail,没有要删除的结点直接返回;
- 将后一结点val替代当前结点val,后一结点next替代当前next,即将下一结点移到本结点,本结点指向下下结点。
/**
* 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->next==NULL) return;
node->val=node->next->val;
node->next=node->next->next;
}
};