python数据结构之顺序表

参考链接:

http://www.cnblogs.com/yupeng/p/3405072.html

发现这里的代码有点复杂,可以用更简单的方法实现:代码如下:

class seqlist(object):
    def __init__(self,maxsize):
        self.maxsize = maxsize
        self.data = list(range(1,maxsize,2))
        print(self.data)

        for i in (self.data):
            print(i)
        self.last = len(self.data) - 1

    def is_empty(self):
        if self.last == -1:
            return True
        else:
            return False


    def __len__(self):
        length = self.last + 1
        return length

    def getlength(self):
        return self.last + 1

    def is_full(self):
        if self.last == self.maxsize - 1:
            return True
        else:
            return False

    def getelem(self, index):

        if self.is_empty():#这个函数没用到,但是is_empty函数好像会报错,判断列表是否为空直接用0 == len(self.data)即可
            print('11111111111111=============111111111111111seqlist is empty')
            return
        elif index < 0 or index > self.last:
            print('position is error')
        else:
            return self.data[index]

    def append(self, elem):
        if len(self.data) == 0:
            print('222222222222222222222222seqlist is empty')
            return
        else:
            self.last += 1
            self.data = self.data + [elem]
            print(self.data,'+++++++++++++++++++++++++++++++++++')

    def insert(self, index, elem):
        if self.is_empty():
            self.data = self.data + [elem]
        elif index < 0 or index > self.last + 1:
            print('postion is error')
            return
        elif index == self.last + 1:
            self.last += 1
            self.data = self.data + [elem]
        else:
            print(self.data,'&&&&&&&&&&&&&&&&&&')
            self.data.insert(index,elem)#链表的插入删除直接用python列表内置函数实现比较简单
            print(self.data, '&&&&&&&&&&&&&&&&&&')
            self.last += 1
    def listdel(self, index):
        if self.is_empty():
            print('seqlist is empty')
            return
        elif index < 0 or index > self.last:
            print('position is error')
        else:
            del self.data[index]
ss = seqlist(10)
print(ss)
ss.append(100)
print((ss.data))
ss.insert(0, 100)
print((ss.data))
ss.listdel(0)
print(ss.data)

运行结果如下:

C:\Users\snowshuang\AppData\Local\Programs\Python\Python37\python.exe C:/Users/snowshuang/PycharmProjects/logging/log1.py
[1, 3, 5, 7, 9]
1
3
5
7
9
<__main__.seqlist object at 0x0000020BBBF39F98>
[1, 3, 5, 7, 9, 100] +++++++++++++++++++++++++++++++++++
[1, 3, 5, 7, 9, 100]
[1, 3, 5, 7, 9, 100] &&&&&&&&&&&&&&&&&&
[100, 1, 3, 5, 7, 9, 100] &&&&&&&&&&&&&&&&&&
[100, 1, 3, 5, 7, 9, 100]
[1, 3, 5, 7, 9, 100]

Process finished with exit code 0
 

你可能感兴趣的:(python数据结构之顺序表)