双向链表

双向链表

每个节点有两个链接：一个指向前一个节点，当此节点为第一个节点时，指向空值；而另一个指向下一个节点，当此节点为最后一个节点时，指向空值。

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

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
        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 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.prev

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

    def insert(self, pos, item):
        """指定位置插入"""
        if pos <= 0:
            self.add(item)
        elif pos > self.length() - 1:
            self.append(item)
        else:
            cur = self._head
            pre = self._head
            count = 0
            while count < pos :
                count += 1
                pre = pre.next
            # 当循环退出后，pre指向pos-1位置
            node = Node(item)
            node.next = cur
            node.prev = cur.prev
            cur.prev.next = node
            cur.prev = node

            pre.next = node

    def remove(self, item):
        cur = self._head
        while cur != None:
            if cur.elem == item:
                #先判断此节点是否为头结点
                #头结点
                if cur ==self._head:
                    self._head = cur.next
                    cur.next.prev = None
                else:
                    cur.prev.next = cur.next
                    cur.next.prev = cur.prev
                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 = DoubleLinkList()
    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()

单向循环链表

单链表的一个变形时单向循环链表，链表中最后一个节点的Next域不在是None,而是指向链表的头结点。

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

#单链表的结构
class SingleLinkList(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):
        # cur游标，用来移动遍历节点
        cur = self._head
        count = 1
        while cur.next!=self._head:
            count += 1
            cur = cur.next
        return count

    def travel(self):#遍历
        if self.is_empty():
            return None
        cur = self._head
        while cur.next!=self._head:
            print(cur.elem,end=' ')
            cur = cur.next
        #退出循环，cur指向尾结点，但尾结点的元素未打印
        print(cur.elem)


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

    def add(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指向尾结点
            node.next = self._head
            self._head = node
            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
             #当循环退出后，pre指向pos-1位置
            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.next!=self._head:
                        rear = rear.next
                    self._head = cur.next
                    rear.next = self._head
                else:#中间节点
                    pre.next = cur.next
                break
            else:
                pre = cur
                cur = cur.next
            #退出循环，cur指向尾结点
            if cur.elem == item:
                if cur == self._head:
                    #链表只有一个节点
                    self._head = None
                else:
                    pre.next = cur.next

    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.elem == item:
            return True
        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()