用Python仿照C語(yǔ)言來(lái)實(shí)現(xiàn)線性表的順序存儲(chǔ)結(jié)構(gòu)，供大家參考，具體內(nèi)容如下
本文所采用的數(shù)據(jù)結(jié)構(gòu)模板為 《數(shù)據(jù)結(jié)構(gòu)教程》C語(yǔ)言版，李春葆、尹為民等著。
該篇所涉及到的是線性表的順序存儲(chǔ)結(jié)構(gòu)。
代碼：
|
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
# !/usr/bin/env python# -*- coding: utf-8 -*- __author__ = 'MrHero' class Node(object): """ 線性表的存儲(chǔ)結(jié)構(gòu) 和 C 語(yǔ)言中的鏈?zhǔn)酱鎯?chǔ)結(jié)構(gòu)類似 """ def __init__(self, data=None): self.data = data self.next = None class LKList(object): """ 線性表的具體操作 """ def __init__(self): """ 相當(dāng)于初始化線性表, 即創(chuàng)建頭結(jié)點(diǎn) 頭節(jié)點(diǎn)為空節(jié)點(diǎn)，占據(jù)位置號(hào)為0 創(chuàng)建好的表即為: 頭節(jié)點(diǎn)[0]->節(jié)點(diǎn)[1]->節(jié)點(diǎn)[2]->節(jié)點(diǎn)[3]->節(jié)點(diǎn)[4] :return: """ self.L = Node(None) self.L.next = None self.length = 0 def is_empty(self): """ 判斷線新表的長(zhǎng)度 :return: """ return self.length == 0 def get_length(self): """ 獲取線新表的長(zhǎng)度 :return: """ return self.length def insert(self, i, elem): """ 在指定位i處置插入元素elem :param i: 指定的位置 :param elem: 插入的元素elem :return: """ j = 0 p = self.L while j < i-1 and p is not None: # 查找第 i-1 個(gè)節(jié)點(diǎn) j += 1 p = p.next if p is None: # 未找到邏輯位序?yàn)?i-1 的節(jié)點(diǎn) raise IndexError("Index is out of range!") else: # 找到邏輯位序?yàn)?i-1 的節(jié)點(diǎn) tmp = Node(elem) tmp.next = p.next p.next = tmp self.length += 1 def delete(self, i): """ 刪除指定節(jié)點(diǎn)的元素 :param i: 指定節(jié)點(diǎn) :return: 刪除的指定節(jié)點(diǎn)元素值 """ if self.is_empty(): raise IndexError("The list is empty!") elif 0 < i <= self.length: j = 1 p = self.L while j < i and p: p = p.next j += 1 delelte_node = p.next p.next = delelte_node.next self.length -= 1 return delelte_node.data else: raise IndexError("Index is out of range!") def get_elem(self, i): """ 獲取某個(gè)節(jié)點(diǎn)的值 :param i: :return:返回某個(gè)節(jié)點(diǎn)的值 """ if self.is_empty(): raise IndexError("The list is empty") elif 0 < i <= self.length: j = 0 p = self.L while j < i and p: p = p.next j += 1 print p.data else: raise IndexError("Index is out of range!") def locate_elem(self, elem): """ 查找某值的位置 :param elem: :return: 返回第一個(gè)值等于elem的位置 """ j = 0 p = self.L while p is not None and p.data != elem: p = p.next j += 1 if p is Node: return -1 else: return j def create_dict_list_H(self, list): """ 頭插法建表 :param list: :return: """ p = self.L for i in range(len(list)): tmp = Node(list[i]) tmp.next = p.next p.next = tmp self.length += 1 def create_dict_list_E(self, list): """ 尾插法建表 :param list: :return: """ p = self.L r = p for i in range(len(list)): tmp = Node(list[i]) r.next = tmp r = tmp self.length += 1 r.next = None def show_lklist(self): if self.is_empty(): raise IndexError("It's a empty list!") else: j = 1 p = self.L while j <= self.length and p: p = p.next if p is not None: print p.data j += 1 if __name__ == '__main__': lk = LKList() # # lk.create_dict_list_E([1, 2, 3, 4]) # print "-----" # lk.get_elem(1) # lk.get_elem(2) # lk.get_elem(3) # lk.get_elem(4) # print "-------" # lk.show_lklist() # lk.insert(3, 5) # print "-------" # lk.show_lklist() # lo = lk.locate_elem(5) # print "location is %d" % lo # lk.delete(4) # print "-------" # lk.show_lklist() |
以上就是本文的全部?jī)?nèi)容，希望對(duì)大家的學(xué)習(xí)有所幫助，也希望大家多多支持服務(wù)器之家。
原文鏈接：https://blog.csdn.net/lqzhouxx/article/details/40846177
