数据结构-单链表-python

__author__ = 'hp'

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

class SingleLinkedList:
    """单链表"""
    def __init__(self, node=None):
        self._head = node

    def is_empty(self):
        return self._head == None

    def length(self):
        cur = self._head
        count = 0
        while cur:
            count += 1
            cur = cur.next
        return count

    def travel(self):
        cur = self._head
        while cur:
            print(cur.item,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._head == None:
            self._head = node
        else:
            cur = self._head
            while True:
                if not cur.next:
                    cur.next = node
                    break
                cur = cur.next

    def insert(self,pos,item):
        if pos <1:
            self.add(item)
        elif pos > self.length():
            self.append(item)
        else:
            node = Node(item)
            pre = self._head
            for i in range(pos-1):
                pre = pre.next
            node.next = pre.next
            pre.next = node



    def remove(self,item):

        # 单个游标
        if self.length() == 0:
            return False
        elif item == self._head.item:
            self._head = self._head.next
            return 'head'
        else:
            pre = self._head
            while pre != None:
                if pre.next.item == item:
                    pre.next = pre.next.next
                    return True
                else:
                    pre = pre.next
            return False

        # 双游标
        # pre = None
        # cur = self._head
        # while cur != None:
        #     if cur.item == item:
        #         # 如果是头结点
        #         if cur == self._head:
        #             self._head = cur.next
        #         else:
        #             pre.next = cur.next
        #         return True
        #     else:
        #         pre = cur
        #         cur = cur.next
        # return False








    def search(self,item):
        cur = self._head
        while cur != None:
            if cur.item == item:
                return True
            else:
                cur = cur.next
        return False



if __name__ == "__main__":
    ll = SingleLinkedList()
    print(ll.is_empty())
    print(ll.length())

    ll.append(1)
    ll.append(2)
    ll.append(5)
    ll.append(8)
    print(ll.is_empty())
    print(ll.length())
    ll.add(55)
    ll.add('head')
    ll.insert(0,33)
    ll.travel()
    ll.remove(5)
    ll.remove(33)
    ll.remove(8)
    ll.travel()


   # ab = SingleLinkedList()
  #  print(ab.remove(8))