-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2.2-链表.py
More file actions
90 lines (71 loc) · 2.14 KB
/
2.2-链表.py
File metadata and controls
90 lines (71 loc) · 2.14 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
83
84
85
86
87
88
class Node:
def __init__(self, data):
self.data = data
self.next = None
class LinkedList:
def __init__(self):
self.size = 0
self.head = None
self.last = None
def get(self, index):
if index < 0 or index >= self.size:
raise Exception("超出链表节点范围!")
p = self.head
for i in range(index):
p = p.next
return p
def insert(self, data, index):
if index < 0 or index > self.size:
raise Exception("超出链表节点范围!")
node = Node(data)
if self.size == 0:
# 空链表
self.head = node
self.last = node
elif index == 0:
# 插入头部
node.next = self.head
self.head = node
elif index == self.size:
# 插入尾部
self.last.next = node
self.last = node
else:
# 插入中间
prev_node = self.get(index-1)
node.next = prev_node.next
prev_node.next = node.next
self.size += 1
def remove(self, index):
if index < 0 or index >= self.size:
raise Exception("超出链表节点范围!")
removed_node = None # 暂存被删除的节点,用于返回
if index == 0:
# 删除头节点
removed_node = self.head
self.head = self.head.next
elif index == self.size - 1:
# 删除尾部
removed_node = self.last
self.last = self.get(index-1)
self.last.next = None
else:
# 删除中间
prev_node = self.get(index-1)
removed_node = prev_node.next
prev_node.next = removed_node.next
self.size -= 1
return removed_node
def output(self):
p = self.head
while p is not None:
print(p.data)
p = p.next
linkedList = LinkedList()
linkedList.insert(3, 0)
linkedList.insert(4, 0)
linkedList.insert(9, 2)
linkedList.insert(5, 3)
linkedList.insert(6, 1)
linkedList.remove(0)
linkedList.output()