题目要求
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
题目分析及思路
要求写一个函数，删除一个单链表中的一个结点（除了最后一个）。函数不需要返回值，只需要原地修改给定删除结点。我们可以将要删除结点的两个属性用该结点的下一个结点的两个属性来替代。
python代码
# Definition for singly-linked list.
# class ListNode:
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution:
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