链表

链表

顺序表的结构需要预先知道数据大小来申请连续的存储空间，而在进行扩充时有需要进行数据的搬迁，所以使用起来并不是很灵活。
链表结构可以充分利用计算机内存空间，实现灵活的内存动态管理。

单向链表

    """节点"""
    def __init__(self,elem):
        self.elem = elem
        self.next = None

#单链表的结构
class SingleLinkList(object):
    """单链表"""
    def __init__(self,node=None):
        self._head = node

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

    def length(self):
        # cur游标，用来移动遍历节点
        cur = self._head
        count = 0
        while cur != None:
            count += 1
            cur = cur.next
        return count

    def travel(self):#遍历
        cur = self._head
        while cur!=None:
            print(cur.elem,end=' ')
            cur = cur.next


    #def add(selfs,item):#链表头部添加

    def append(self,item):#链表尾部添加
        node = Node(item)
        if self.is_empty():
            self._head = node
        else:
            cur = self._head
            while cur.next!=None:
                cur = cur.next
            cur.next = node

    def add(self,item):
        """在链表头部添加"""
        node = Node(item)
        node.next=self._head
        self._head = node


    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
             #当循环退出后，pre指向pos-1位置
            node = Node(item)
            node.next = pre.next
            pre.next = node


    def remove(self,item):
        cur = self._head
        pre = None
        while cur!=None:
            if cur.elem == item:
                if not pre:
                    self._head=cur.next
                else:
                    pre.next=cur.next
                break
            else:
                pre = cur
                cur = cur.next


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


if __name__=='__main__':
    li = SingleLinkList()
    print(li.is_empty())
    print(li.length())

    li.append(1)
    li.append(2)
    li.append(3)
    li.append(4)
    li.append(5)
    li.append(6)
    li.add(8)
    li.insert(-1,9)
    li.remove(9)
    li.travel()