-
Notifications
You must be signed in to change notification settings - Fork 2.6k
Expand file tree
/
Copy pathExercise_3.py
More file actions
82 lines (66 loc) · 2.16 KB
/
Copy pathExercise_3.py
File metadata and controls
82 lines (66 loc) · 2.16 KB
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
# Time Complexity : O(n)
# append: O(n)
# find: O(n)
# remove: O(n)
# Space Complexity : O(1)
# Did this code successfully run on Leetcode : yes
# Any problem you faced while coding this : No
class ListNode:
"""
A node in a singly-linked list.
"""
def __init__(self, data=None, next=None):
self.data = data
self.next = next
class SinglyLinkedList:
def __init__(self):
"""
Create a new singly-linked list.
Takes O(1) time.
"""
self.head = None
def append(self, data):
"""
Insert a new element at the end of the list.
Takes O(n) time.
"""
if self.head is not None:
current = self.head
while current.next is not None:
current = current.next
current.next = ListNode(data)
else:
self.head = ListNode(data)
def find(self, key):
"""
Search for the first element with `data` matching
`key`. Return the element or `None` if not found.
Takes O(n) time.
"""
if self.head is not None:
current = self.head
while current is not None:
if current.data == key:
return "Found the matching key"
current = current.next
return None
return None
def remove(self, key):
"""
Remove the first occurrence of `key` in the list.
Takes O(n) time.
"""
if self.head is not None:
current = self.head
pointer = self.head
while current is not None:
if current.data == key:
if current == self.head:
self.head = self.head.next
return "key removed"
pointer.next = current.next
return "key removed"
pointer = current
current = current.next
return None
return None