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  # 此处用is更符合编码规范

    def length(self):  # 获取链表长度
        cur = self._head
        count = 0
        while cur is not None:
            count += 1
            cur = cur.next
        return count

    def travel(self):  # 遍历链表
        cur = self._head
        while cur is not None:
            print(cur.elem, end=" ")
            cur = cur.next
        print("")  # 目的是换行

    def add(self, item):  # 链表头部添加元素
        node = Node(item)
        node.next = self._head  # 新元素的域指向原有head指向的首节点
        self._head = node
        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 is not 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
                # cur.prev=node
                # node.prev.next=node

    def remove(self, item):  # 删除节点

        cur = self._head  # 定义了两个游标
        while cur is not None:
            if cur.elem == item:
                # 判断此节点是否是头节点
                if cur == self._head:
                    self._head = cur.next
                    if cur.next:  # 判断链表是否只有1个节点
                        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 is not None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False


if __name__ == "__main__":
    ll = DoubleLinkList()
    print(ll.is_empty())
    print(ll.length())
    ll.append(1)
    print(ll.is_empty())
    print(ll.length())

    ll.append(2)
    ll.add(8)
    ll.append(3)
    ll.append(4)
    ll.append(5)
    ll.append(6)
    # 8 1 2 3 4 5 6
    ll.insert(-1, 9)  # 添加在头部
    ll.travel()
    ll.insert(2, 100)  # 添加在1后面
    ll.travel()
    ll.insert(10, 200)  # 添加在尾部
    ll.travel()
    ll.remove(100)
    ll.travel()
    ll.remove(200)
    ll.travel()
    ll.remove(9)
    ll.travel()

单向循环链表

定义

单链表的一个变形是单向循环链表，链表中最后一个节点的next域不再为None，而是指向链表的头节点。

代码实现

class Node(object): # 创建节点类
    def __init__(self, elem):
        self.elem = elem
        self.next = None


class SingleCycleLinkList(object):  # 创建单链表类
    def __init__(self, node=None):
        self._head = node
        if node:
            node.next = node

    def is_empty(self):  # 链表是否为空
        return self._head == 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():
            return
        cur = self._head
        while cur.next != self._head:
            print(cur.elem, end=" ")
            cur = cur.next
        print(cur.elem)

    def add(self, item):  # 链表头部添加元素
        node = Node(item)
        cur = self._head
        if self.is_empty():
            self._head = node
            node.next = node
       	    return
        while cur.next != self._head:
            cur = cur.next
        node.next = self._head  # 新元素的域指向原有head指向的首节点
        self._head = node
        # cur.next = 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.next = node
            node.next = self._head

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

    def remove(self, item):  # 删除节点
        if self.is_empty():  # 首先判断是否为空
            return
        pre = None
        cur = self._head  # 定义了两个游标
        while cur.next != self._head:
            if cur.elem == item:
                if cur == self._head:
                    # 判断是否是头节点,是的话，需要寻找尾节点
                    rear = self._head  # rear 尾部游标
                    while rear.next != self._head:  # 在退出循环时，游标正好指向尾节点
                        rear = rear.next
                    self._head = cur.next
                    rear.next = self._head
                else:  # 判断是否是中间节点，不存在修改循环的问题
                    pre.next = cur.next
                return
            else:
                pre = cur
                cur = cur.next
                # 退出循环，cur指向尾节点,同时尾节点没有被处理过，后面要单独对尾节点进行处理
        if cur.elem == item:  # 判断尾节点是否为要删除的元素
            if cur == self._head:  # 链表只有一个节点的情况
                self._head = None
            else:
                pre.next = cur.next  # pre.next = self._head

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


if __name__ == "__main__":
    ll = SingleCycleLinkList()
    print(ll.is_empty())
    print(ll.length())
    ll.append(1)
    print(ll.is_empty())
    print(ll.length())

    ll.append(2)
    ll.add(8)
    ll.append(3)
    ll.append(4)
    ll.append(5)
    ll.append(6)  # 8 1 2 3 4 5 6
    ll.insert(-1, 9)  # 添加在头部
    ll.travel()
    ll.insert(2, 100)  # 添加在1后面
    ll.travel()
    ll.insert(10, 200)  # 添加在尾部
    ll.travel()
    ll.remove(100)
    ll.travel()
    ll.remove(200)
    ll.travel()
    ll.remove(9)
    ll.travel()