list的实现

╰半橙微兮° 2024-03-24 23:30 27阅读 0赞

**1** **问题**

在python官方实现中，list是一种采用分离式技术实现的动态顺序表，是线性表的一种，不需要对该元素后面的元素依次移动，是全文的重点所在，开发者在搜索文章的时候，如果问题与他契合，则会更有兴趣并完成全文的阅读。

**2** **方法**

创建list，再使用函数。通过实验、实践等证明提出的方法是有效的，是能够解决开头提出的问题。

代码清单 1

<table> 
 <tbody> 
 <tr> 
 <td>class mysqlist(): &nbsp; &nbsp;def _init_(self,size): &nbsp; &nbsp; &nbsp; &nbsp;self.size=size &nbsp; &nbsp; &nbsp; &nbsp;self.sqlist=[] &nbsp; &nbsp;def listinsert(self,i,x): &nbsp; &nbsp; &nbsp; &nbsp;if i&lt;1 or i&gt;self.size: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;print("Tnsert Location Error!") &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return False &nbsp; &nbsp; &nbsp; &nbsp;else: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;self.sqlist.insert(i,x) &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return True &nbsp; &nbsp;def listdelete(self,i): &nbsp; &nbsp; &nbsp; &nbsp;if i&lt;1 or i&gt;self.size: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;print("Delete Location error!") &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return False &nbsp; &nbsp; &nbsp; &nbsp;else: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;self.sqlist.pop(i) &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return False &nbsp; &nbsp;def findelem(self,i): &nbsp; &nbsp; &nbsp; &nbsp;if i&lt;1 or i&gt;self.size: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;print("search Location Error!") &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return False &nbsp; &nbsp; &nbsp; &nbsp;else: &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;return self.sqlist[i] &nbsp; &nbsp;def showlist(self): &nbsp; &nbsp; &nbsp; &nbsp;return self.sqlist import random testsqlist=mysqlist(10) for i in range(1,12): &nbsp; &nbsp;testqlist.listinsert(i,i*100) print("插入元素后的顺序表为：",testsqlist.showlist()) for i in range(1,2): &nbsp; &nbsp;testsqlist,listdelete(i) print("删除元素后的顺序表为：",testeqlist.showlist()) print(testsqlist.findelem(5))</td> 
 </tr> 
 </tbody> 
</table>

**3** **结语**

本文主要针对我自身的学习问题进行的学习巩固，加深学习记忆。未来可以用该方法解决更多实际问题。