在O(1)时间复杂度删除链表节点

/**
* Definition of ListNode
* class ListNode {
* public:
*     int val;
*     ListNode *next;
*     ListNode(int val) {
*         this->val = val;
*         this->next = NULL;
*     }
* }
*/
class Solution {
public:
/**
* @param node: a node in the list should be deleted
* @return: nothing
*/
void deleteNode(ListNode *node) {
// write your code here
ListNode* p = node->next;//找出给定节点的下一个节点，复制到node节点
node->val = p->val;     //删除p节点。O(1)时间复杂度
node->next = p->next;
delete p;
}
};