Leetcode 237 Delete node in a Linked list (delete nodes in linked list)

translation

给定一个访问节点的路径，写一个函数去删除在一个单向链表中除尾部以外的节点。假设这个链表是1234，并且你被给予了第3个值为3的节点，那么在调用你的函数之后这个链表应该变为124。

Original

Write a function toDelete a node (except theTailinchA singly linkedList,givenOnly access to  thatNode. Supposed theLinkedList  is 1-2-3-4  andYou aregiven  the ThirdNode withValue3, theLinkedListShould become1-2-4  AfterCalling your function.

Code

/*** Definition for singly-linked list.* struct ListNode {*     int val;*     ListNode *next;*     ListNode(int x) : val(x), next(NULL) {}* };*/class Solution {public:    voiddeleteNode(ListNode* node) {        if (node == NULL) {}        else {            ListNode* tmp = node->next;            node->val = tmp->val;            node->next = tmp->next;            delete tmp;        }    }};

Leetcode 237 Delete node in a Linked list (delete nodes in linked list)