算法数据与结构——链表

单链表的操作

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

#node = Node(100)

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
        # 如果是空列表，此时cur = self._head=None

        # count记录数量
        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(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 != 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:
            pre = self.__head
            count = 0
            while count < pos-1:
                count += 1
                pre = pre.next

            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 cur == self.__head:
                    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 != None:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        return False


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

    ll.append(2)
    ll.append(3)
    ll.append(4)
    ll.append(5)
    ll.append(6)
    ll.travel()
    print(ll.search(6))
    ll.remove(6)
    ll.travel()

双链表

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

#node = Node(100)

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

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

   def length(self):
       """链表长度"""
       # cur游标移动遍历元素
       cur = self.__head
       # 如果是空列表，此时cur = self._head=None

       # count记录数量
       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(self,item):
       """链表头部添加元素，头插法"""
       node = Node(item)
       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 != 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()-1:
           self.append(item)
       else:
           cur = self.__head
           count = 0
           while count < pos:
               count += 1
               cur = cur.next

           node = Node(item)
           node.next = cur
           node.prev = cur.prev
           cur.prev.next = node
           cur.prev = node

   def remove(self,item):
       """删除节点"""
       cur = self.__head
       while  cur != None:
           if cur.elem == item:
               if cur == self.__head:
                   self.__head = cur.next

                   # 判断链表是否只有一个节点
                   if cur.next:
                       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 != 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(2)
   ll.append(3)
   ll.append(4)
   ll.append(5)
   ll.append(6)
   ll.travel()
   print(ll.search(6))
   ll.remove(6)
   ll.travel()

单向循环列表

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

#node = Node(100)

class SingleCircleLinkList(object):
    """单向循环链表"""
    def __init__(self,node=None):
        self.__head = node
        if node:
            node.next = node

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

    def length(self):
        """链表长度"""
        if self.is_empty():
            return 0
        # cur游标移动遍历元素
        cur = self.__head
        # 如果是空列表，此时cur = self._head=None
        # count记录数量
        count = 1
        while cur.next != self.__head:
            count += 1
            cur = cur.next
        return count


    def travel(self):
        """遍历整个链表"""
        if self.is_empty():
            return 0
        cur = self.__head
        while cur.next != self.__head:
            print(cur.elem,end=' ')
            cur = cur.next
        print(cur.elem)


    def add(self,item):
        """链表头部添加元素，头插法"""
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
            return
        while cur.next != self.__head:
            cur = cur.next
        node.next = self.__head
        self.__head = node
        cur.next = node #cur.next = self.__head

    def append(self,item):
        """链表尾部添加元素，尾插法"""
        node = Node(item)
        if self.is_empty():
            self.__head = node
            node.next = node
        else:
            cur = self.__head
            while cur.next != self.__head:
                cur = cur.next
            cur.next = node
            node.next = self.__head

    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

            node = Node(item)
            node.next = pre.next
            pre.next = node

    def remove(self,item):
        """删除节点"""
        if self.is_empty():
            return
        cur = self.__head
        pre = None
        while  cur.next != self.__head:
            if cur.elem == item:
                # 头节点
                # 需要找到尾节点
                if cur == self.__head:
                    rear = self.__head
                    while rear != self.__head:
                        rear = rear.next
                    self.__head = cur.next
                    rear.next = cur

                else: #中间节点
                    pre.next = cur.next
                return
            #尾结点
            else:
                pre = cur
                cur = cur.next
        if cur.elem == item:
                if cur == self.__head:
                    self.__head = None
                else:
                    pre.next = self.__head


    def search(self,item):
        """查找节点是否存在"""
        if self.is_empty():
            return False
        cur = self.__head
        while cur.next != self.__head:
            if cur.elem == item:
                return True
            else:
                cur = cur.next
        if cur.next == item:
            return True
        return False


if __name__ =='__main__':
    ll = SingleCircleLinkList()
    print(ll.is_empty())
    print(ll.length())

    ll.append(2)
    ll.append(3)
    ll.append(4)
    ll.append(5)
    ll.append(6)
    ll.travel()
    ll.search(6)
    #print(ll.search(6))
    ll.remove(6)
    ll.travel()