数据结构——双向链表及Python实现

双向链表

一种更复杂的链表是“双向链表”或“双面链表”。每个节点有两个链接：一个指向前一个节点，当此节点为第一个节点时，指向空值；而另一个指向下一个节点，当此节点为最后一个节点时，指向空值。

Python实现

# coding:utf-8

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


class DoubleLinkList(object):
    """双向链表"""
    def __init__(self, node=None):
        self.__head = node

    def is_empty(self):
        """链表是否为空"""
        return self.__head is None

    def length(self):
        """链表长度"""
        count = 0
        cur = self.__head
        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)
        if self.is_empty():
            # 如果是空链表
            self.__head = node
        else:
            node.next = self.__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():
            self.append(item)
        else:
            node = Node(item)
            pre = self.__head
            count = 0
            while count < (pos-1):
                count += 1
                pre = pre.next
            # while循环结束后，pre指向pos-1
            node.prev = pre
            node.next = pre.next
            pre.next.prev = node
            pre.next = node

    def remove(self, item):
        """删除节点"""
        if self.is_empty():
            return None
        pre = None
        cur = self.__head
        while cur.next is not None:
            if cur.elem == item:
                if self.__head == cur:
                    # 对于头节点
                    if cur.next is not None:
                        cur.next.prev = None
                        self.__head = cur.next
                    else:
                        self.__head = None
                else:
                    # 中间节点
                    pre.next = cur.next
                    cur.next.prev = pre
                return
            else:
                pre = cur
                cur = cur.next
        # while循环结束后，cur指向尾结点
        # 对于尾结点
        if cur.elem == item:
            pre.next = None
        else:
            return

    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.travel()

    ll.append(2)
    ll.add(8)
    ll.append(3)
    ll.append(4)
    ll.append(5)
    ll.append(6)
    ll.travel()
    # 8 1 2 3 4 5 6
    ll.insert(-1, 9)  # 9 8 1 2 3 4 5 6
    ll.travel()
    ll.insert(2, 100)  # 9 8 100 1 2 3 4 5 6
    ll.travel()
    ll.insert(10, 200)  # 9 8 100 1 2 3 4 5 6 200
    ll.travel()
    ll.remove(100)
    ll.travel()
    ll.remove(9)
    ll.travel()
    ll.remove(200)
    ll.travel()