python数据结构——双向链表和单项循环链表代码实现详解

双向链表：

class Node(object):
    """节点类"""
    def __init__(self, item):
        self.item = item  # 第一个元素类/实例变量
        self.next = None  # 下一节点
        self.pre = None


class ShuangxiangleNode(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 is not None:
            count += 1
            cur = cur.next
        return count

    def tarver(self):
        """遍历整个链表"""
        cur = self.__head
        while cur is not None:
            print(cur.item, end=" ")
            cur = cur.next
        print()

    def add(self, item):
        """向链表头添加数据"""
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            node.next = self.__head
            self.__head.par = node
            self.__head = node

    def append(self, item):
        """向链表尾添加数据"""
        node = Node(item)
        if self.is_empty():
            self.__head = node
        else:
            cur = self.__head
            while cur.next is not None:
                cur = cur.next
            # 退出循环的时候，cur指向尾节点
            cur.next = node
            node.pre = cur

    def insert(self, pos, item):
        """指定位置添加"""
        node = Node(item)
        if pos <= 0:
            self.add(item)
        elif pos > self.length():
            self.append(item)
        else:
            count = 0
            cur = self.__head
            while count < (pos - 1):
                count += 1
                cur = cur.next
            node.next = cur.next
            node.pre = cur
            cur.next.pre = node
            cur.pre = node

    def remove(self, item):
        """删除节点"""
        cur = self.__head
        while cur != None:
            # 找到删除元素
            if cur.item == item:
                # 先判断此结点是否是头节点
                # 头节点
                if cur == self.__head:
                    self.__head = cur.next
                    # 如果存在下一个结点，则设置下一个结点
                else:
                    # 如果存在下一个结点，则设置下一个结点
                    cur.pre.next = cur.next
                    # 删除中间元素
                    if cur.next:
                        cur.next.pre = cur.pre
                break
            else:
                cur = cur.next

    def search(self, item):
        """链表查找节点是否存在，并返回True或者False"""
        cur = self.__head
        while cur != None:
            if cur.item == item:
                return True
            cur = cur.next
        return False


if __name__ == '__main__':
    ll = ShuangxiangleNode()
    ll.add(1)
    ll.tarver()
    ll.add(2)
    ll.tarver()
    ll.append(3)
    ll.tarver()
    ll.insert(2, 4)
    ll.tarver()
    ll.insert(4, 5)
    ll.tarver()
    ll.insert(0, 6)
    ll.tarver()
    print("length:", ll.length())
    print(ll.search(3))
    print(ll.search(4))
    ll.remove(1)
    print("length:", ll.length())

结果：
**

单向循环链表：

**

class Node(object):
    """结点类"""

    def __init__(self, item):
        self.item = item
        self.next = None


class CycleSingleLinkList(object):
    """单向循环链表"""

    def __init__(self, node=None):
        self.__head = node

    def is_empty(self):
        """链表是否为空
        :return 如果链表为空 返回真
        """
        return self.__head is None

    def length(self):
        """链表长度"""
        if self.is_empty():
            return 0
        cur = self.__head
        count = 1
        while cur.next != self.__head:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        """遍历整个链表"""
        if self.is_empty():
            print("")
            return
        cur = self.__head
        while cur.next != self.__head:
            print(cur.item, end=" ")
            cur = cur.next
        # 从循环退出，cur指向的尾结点
        print(cur.item)

    def add(self, item):
        """链表头部添加元素
        :param item: 要保存的具体数据
        """
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
        # 寻找尾结点
        cur = self.__head
        while cur.next != self.__head:
            cur = cur.next
        # 从循环退出，cur指向的尾结点
        node.next = self.__head
        self.__head = node
        cur.next = self.__head

    def append(self, item):
        """链表尾部添加元素"""
        node = Node(item)
        # 如果链表为空，需要特殊处理
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            cur = self.__head
            while cur.next != self.__head:
                cur = cur.next
            # 退出循环的时候，cur指向的尾结点
            cur.next = node
            node.next = self.__head

    def insert(self, pos, item):
        """指定位置添加元素"""
        # 在头部添加元素
        if pos <= 0:
            self.add(item)
        # 在尾部添加元素
        elif pos >= self.length():
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count < (pos - 1):
                count += 1
                cur = cur.next
            # 退出循环的时候，cur指向pos的前一个位置
            node = Node(item)
            node.next = cur.next
            cur.next = node

    def remove(self, item):
        """删除节点"""
        if self.is_empty():
            return
        cur = self.__head
        pre = None
        while cur.next != self.__head:
            # 找到了要删除的元素
            if cur.item == item:
                # 在头部找到了元素
                if cur == self.__head:
                    # 先找到尾结点
                    rear = self.__head
                    while rear.next != self.__head:
                        rear = rear.next
                    # 退出循环后，rear指向为尾结点
                    self.__head = cur.next
                    rear.next = self.__head
                else:
                    pre.next = cur.next
                return
            # 不是要找的元素，移动游标
            pre = cur
            cur = cur.next
        # 退出循环后，cur指向为尾结点
        if cur.item == item:
            # 链表只有一个结点
            if cur == self.__head:
                self.__head = None
            else:
                pre.next = self.__head

    def search(self, item):
        """查找节点是否存在"""
        if self.is_empty():
            return False
        cur = self.__head
        while cur.next != self.__head:
            if cur.item == item:
                return True
            cur = cur.next
        # 退出循环后，cur指向为尾结点
        if cur.item == item:
            return True
        return False


if __name__ == '__main__':
    ll = CycleSingleLinkList()
    print(ll.length())
    ll.travel()
    ll.append(1)  # 1
    print(ll.length())
    ll.travel()
    ll.append(2)  # 1 2
    ll.travel()
    ll.add(3)  # 3 1 2
    ll.travel()
    ll.insert(0, 4)  # 4 3 1 2
    ll.travel()
    ll.insert(19, 5)  # 4 3 1 2 5
    ll.travel()
    ll.insert(2, 6)  # 4 3 6 1 2 5
    ll.travel()
    ll.remove(4)  # 3 6 1 2 5
    ll.travel()
    ll.remove(5)  # 3 6 1 2
    ll.travel()
    ll.remove(6)  # 3  1 2
    ll.travel()
    ll.remove(3)  # 1 2
    ll.travel()
    ll.remove(2)  # 1
    ll.travel()
    ll.remove(1)  #
    ll.travel()

结果：