237. Delete Node in a Linked List 删除链表中的节点

237. Delete Node in a Linked List

---

 

 

思路：用node节点的下一个节点来覆盖node节点，然后删除node的下一个节点

/**
 * 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* pNext = node->next;
        node->val = pNext->val;
        node->next = pNext->next;
        
        delete pNext;
        pNext = nullptr;
    }
};