[237]Delete Node in a Linked List

【题目描述】

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 -> 4after calling your function.

【思路】

题目里没有给出链表的头结点，不能用常规的方法解决，这道题的思路是将下个节点的值和next赋给要删除的这个节点，然后再将这个节点的下个节点删除。

【代码】

** * 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==NULL) return;        node->val = node->next->val;        node->next = node->next->next;    }};