leetcode-273-Delete Node in a Linked List

问题

题目：[leetcode-273]

思路

没有头结点，只能把下一个替换当前即可。

代码

/**
 * 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* p = node->next;
        ListNode* q = p->next;

        node->val = p->val;
        node->next = q;

        delete p;
    }
};