题目： 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.
思路： 删除一个节点（不是最后的那个）。 将要删除的下一个节点的值赋给要删除的节点，删除下一个节点 代码：
/**
* 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) {
ListNode* del=node->next;
node->val=node->next->val;
node->next=node->next->next;
delete del;
}
};
转载请注明原文地址: https://ju.6miu.com/read-9323.html
