Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
void deleteNode(struct ListNode* node) {
if(node == NULL) return;
node->val = node->next->val;
node->next = node->next->next;
}
大概思想将下一个节点辅助节点