數據結構與算法-python描述-雙向鏈表

# coding:utf-8

# 雙向鏈表的相關操做：
# is_empty() 鏈表是否爲空
# length() 鏈表長度
# travel() 遍歷鏈表
# add(item) 鏈表頭部添加
# append(item) 鏈表尾部添加
# insert(pos, item) 指定位置添加
# remove(item) 刪除節點
# search(item) 查找節點是否存在


class Node(object):
    """節點"""

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


class DoubleLinkedList(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 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當前指向最後一個節點
            cur.next = node
            node.prev = cur

    def insert(self, pos, item):
        """指定位置添加"""
        node = Node(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

            # 循環結束，cur指向要插入的位置
            node.next = cur
            node.prev = cur.prev
            cur.prev.next = node
            cur.prev = 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 is not None:
                        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__":
    dll = DoubleLinkedList()

    print("before initialized:", dll.is_empty())
    print("before initialized:", dll.length())

    dll.add(1)
    dll.add(2)
    dll.add(3)
    dll.add(4)
    dll.add(5)
    dll.add(6)
    dll.travel()

    dll.append(7)
    dll.travel()

    dll.insert(3, 100)
    dll.travel()

    dll.remove(3)
    dll.travel()