LeetCode---链表1

1、题目

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.

2、解答： 该题难点在于无法找到node节点的前一个结点，所以不能用常规方法做。因此用"替换"的方法来解决.

 

3、代码 C++

 

class Solution {
public:
    void deleteNode(ListNode* node) {
        ListNode *p;            
        p = node->next;             //保存node节点的下一个节点，用来释放节点
        node->val = node->next->val;
        node->next = node->next->next;
        free(p);
    }
};

 代码python

class Solution(object):
    def deleteNode(self, node):
        """
        :type node: ListNode
        :rtype: void Do not return anything, modify node in-place instead.
        """
        
        node.val = node.next.val
        node.next = node.next.next