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.
解题思路:将需要删除元素后面的所有元素往前移。
solution:
/**
* 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) {
while(node != NULL) {
if(node->next != NULL) {
node->val = node->next->val;
//cut the tail
if(node->next->next == NULL) {
node->next = NULL;
}
}
node = node->next;
}
delete node;
}
};