給一個(gè)結(jié)點(diǎn)刪除它争群，但是不知道它的前任結(jié)點(diǎn)
因此有一個(gè)辦法就是將該節(jié)點(diǎn)的value和下一個(gè)節(jié)點(diǎn)的value交換回怜，然后刪除下一個(gè)結(jié)點(diǎn)
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
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.val, node.val
node.next = node.next.next
這樣其實(shí)是麻煩了，就把下一個(gè)節(jié)點(diǎn)的值賦值過(guò)來(lái)换薄，然后把下一個(gè)結(jié)點(diǎn)刪掉就好了呀玉雾，笨死了
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
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
