【ACM从零开始】LeetCode OJ-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 -> 4 after calling your function.

题目大意：删除单链表中的一个结点。

解题思路：非常基础的题(⊙﹏⊙)b

AC代码：

class Solution {
public:
    void deleteNode(ListNode* node) {
       if(!node)return;
       node->val = node->next->val;
       node->next = node->next->next;
    }
};

【ACM从零开始】LeetCode OJ-Delete Node in a Linked List

原文：http://www.cnblogs.com/shvier/p/4869208.html