1 顺序表

1
class SequenceList:
2

3
    # 初始化
4
    def __init__(self):
5
        self.seqList = [] # 初始化一个空表
6

7
    # 创建顺序表
8
    def CreateSeqList(self):
9
        element = input("please enter(input #:end):")
10
        while element != '#':
11
            self.seqList.append(int(element))
12
            element = input("please enter(input #:end):")
13

14
    # 查找顺序表中某一个元素
15
    def FindElement(self):
16
        key = int(input("please enter what you want to find:"))
17
        if key in self.seqList:
18
            keyPosition = self.seqList.index(key)
19
            result = keyPosition
20
        else:
21
            result = "none"
22
        return result
23

24
    # 在指定位置上插入元素
25
    def InsertElement(self):
26
        postion = int(input("请输入要插入的位置："))
27
        key = int(input("请输入要插入的值："))
28
        print("插入前顺序：", self.seqList)
29
        self.seqList.insert(postion, key)
30
        print("插入后顺序：", self.seqList)
31

32
    # 在指定位置上删除元素
33
    def DeleteElement(self):
34
        postion = int(input("请输入要删除元素的位置："))
35
        print("删除前的顺序表：", self.seqList)
36
        if postion < len(self.seqList) and postion >= 0:
37
            del self.seqList[postion]
38
            return self.seqList
39
        else:
40
            print("不存在啊老铁，删除个毛线啊")
41

42
    # 遍历顺序表元素
43
    def TraverseElement(self):
44
        for i in range(len(self.seqList)):
45
            print(self.seqList[i], end =' ')
46

47
    # 判空
48
    def IsEmpty(self):
49
        return len(self.seqList) == 0
50

51
    # 销毁顺序表
52
    def DestorySeqList(self):
53
        print("销毁前顺序表：", self.seqList)
54
        self.__init__()
55
        print("销毁后顺序表：", self.seqList)
56

57

58
# 测试
59
if __name__ == '__main__':
60
    list = SequenceList()
61
    list.CreateSeqList()
62
    print(list.seqList)
63
    print(list.FindElement())
64
    list.InsertElement()
65
    list.DeleteElement()
66
    list.TraverseElement()
67
    list.IsEmpty()
68
    list.DestorySeqList()