-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path237.py
More file actions
42 lines (32 loc) · 972 Bytes
/
237.py
File metadata and controls
42 lines (32 loc) · 972 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
'''
237. Delete Node in a Linked List
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.
'''
from ListNode import *
# 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
def test():
a = [1, 2, 3, 4]
headA = List_to_Link(a).head
sol = Solution()
nd3 = headA.next.next
print(nd3.val)
sol.deleteNode(nd3)
Link_to_List(headA).print_list()
if __name__ == "__main__":
test()