leetcode-grind/problems/237/main.py

# 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

def printList(l):
    while l is not None:
        print(l.val, end=" ")
        l = l.next

s = Solution()
print("Expected: 4 1 9")
l = ListNode(4)
node = ListNode(5)
anode = ListNode(1)
bnode = ListNode(9)
anode.next = bnode
node.next = anode
l.next = node

s.deleteNode(node)
print("Got:", end=" ")
printList(l)
print("")