237. Delete Node in a Linked List--LeetCode Record

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.

沒有swift選擇，所有就用c++了，語法都忘了。。。

/**
 * 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) {
        // 向後刪除
        if(node->next)
        {
            node->val=node->next->val;
            node->next=node->next->next;
        }
        else
            node=NULL;
    }
};