python代码实现双向链表

class Node(object):
    def __init__(self, item):
        self.elem = item
        self.next = None
        self.prev = None

class DoubleLinkList(object):
    def __init__(self, node = None):
        self.__head = node
    def is_empty(self):
        return self.__head is None

    def length(self):
        cur = self.__head
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        cur = self.__head
        while cur != None:
            print(cur.elem, end=' ')
            cur = cur.next

    def add(self, item):
        node = Node(item)
        node.next = self.__head
        self.__head = node
        if node.next:
            node.next.prev = node

    def append(self, item):
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head
            while cur.next != None:
                cur = cur.next
            cur.next = node
            node.prev = cur

    def insert(self, pos, item):
        if pos <= 0:
            self.add(item)
        elif pos > (self.length()-1):
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count < (pos):
                count += 1
                cur = cur.next
            node = Node(item)
            node.next = cur
            node.prev = cur.prev
            cur.prev.next = node
            cur.prev = node

    def remove(self, item):
        cur =self.__head
        while cur != None:
            if cur == self.__head:
                self.__head = cur.next
                if cur.next:
                    cur.next.prev = None
            else:
                cur.prev.next = cur.next
                if cur.next:
                    cur.next.prev = cur.prev
            break
        else:
            cur = cur.next

    def search(self, item):
        cur = self.__head
        while cur != None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False

if __name__ == '__main__':
    double_boj = DoubleLinkList()
    print(double_boj.is_empty())
    print(double_boj.length())
    
    double_boj.add(88)
    double_boj.append(1)
    print(double_boj.is_empty())
    print(double_boj.length())

    double_boj.append(10)
    double_boj.append(15)
    double_boj.append(19)
    print(double_boj.travel())

    double_boj.insert(4, 'abc')
    print(double_boj.travel())
    double_boj.insert(-6, 'hello')
    print(double_boj.travel())
    double_boj.remove('hello')
    print(double_boj.travel())
    double_boj.remove('hello')
    print(double_boj.travel())

C:\Users\user\AppData\Local\Programs\Python\Python36\python.exe “C:/Users/user/PycharmProjects/hellow python/test.py”
True
0
False
2
88 1 10 15 19 None
88 1 10 15 abc 19 None
hello 88 1 10 15 abc 19 None
88 1 10 15 abc 19 None
1 10 15 abc 19 None

Process finished with exit code 0

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值