代码
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
### 0209 原地删除下一个节点(44 ms,15.2 MB)
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