Leetcode 刷题笔记 双向链表

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

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


class SingleLinkList(object):
    def __init__(self):
        self.__head = None

    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.node, end = " ")
            cur = cur.next
        print()

    def add(self, item):
        node = Node(item)
        node.next = self.__head
        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.next = node

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

    def remove(self, item):
        pre = None
        cur = self.__head
        while cur.node != item:
            pre = cur
            cur = cur.next
        pre.next = cur.next


if __name__ == '__main__':
    sll = SingleLinkList()
    print(sll.is_empty())
    sll.add(5)
    print(sll.is_empty())
    sll.add(6)
    sll.add(7)
    print(sll.length())
    sll.travel()
    sll.append(100)
    sll.travel()
    sll.insert(2, 99)
    sll.travel()
    sll.insert(10, 888)
    sll.insert(-10, 777888)
    sll.travel()
    sll.remove(6)
    sll.travel()