python算法 -- 03 链表

链表简介

• 链表是一种常见的数据结构，用于存储数据的集合，它由一系列节点组成。
• 链表不像顺序表一样存储数据，而是在每一个存储单元里存储下一个或上一个节点的位置信息。

单向链表实现

• 每个节点包含一个数据元素和一个指向下一个节点的指针，具体实现如下：

# 链表是一种常见的基础数据结构，是一种线性表，


class Node(object):
    """单向链表节点"""

    def __init__(self, item):
        # item 存放数据元素
        self.item = item
        # next 存放下一个节点的标识
        self.next = None


class SingleLinkList:
    """单向链表操作"""
    def __init__(self, node=None):
        self.__head = node

    def travel(self):
        """遍历并打印链表元素"""
        cur = self.__head
        while cur is not None:
            print(cur.item, end='\t')
            cur = cur.next
        print()

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

    def length(self):
        """链表长度"""
        cur = self.__head
        count = 0
        while cur is not None:
            count += 1
            cur = cur.next
        return count

    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):
        """指定位置插入元素，第一个元素位置为0"""
        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 search(self, item):
        """查找元素"""
        cur = self.__head
        while cur is not None:
            if cur.item == item:
                return True
            else:
                cur = cur.next
        return False

    def remove(self, item):
        """删除元素"""
        cur = self.__head
        pre = None
        while cur is not 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


if __name__ == '__main__':
    single_link_list = SingleLinkList()
    single_link_list.add('元素1')
    single_link_list.add('元素2')

    single_link_list.travel()           # 元素2	元素1
    print(single_link_list.length())    # 2

    single_link_list.insert(1, '元素n')
    single_link_list.travel()           # 元素2	元素n	元素1

    print(single_link_list.search('元素n'))   # True

    single_link_list.remove('元素1')
    single_link_list.travel()            # 元素2	元素n

双向链表实现

• 每个节点包含一个数据元素，2个指针指向上一个和下一个节点，具体实现如下：

class Node(object):
    """双向链表节点"""

    def __init__(self, item):
        # item 存放数据元素
        self.item = item
        # next 存放下一个节点的标识
        self.next = None
        # prev 存放上一个节点的标识
        self.prev = None


class DLinkList:
    """双向链表操作"""
    def __init__(self, node=None):
        self.__head = node

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

    def length(self):
        """链表长度"""
        cur = self.__head
        count = 0
        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.item, end='\t')
            cur = cur.next
        print()

    def add(self, item):
        """链表头部插入元素"""
        node = Node(item)
        node.next = self.__head
        self.__head = node
        if node.next:
            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 is not 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():
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count < pos:
                count += 1
                cur = cur.next
            node = Node(item)
            node.next = cur
            cur.prev.next = node
            node.prev = cur.prev
            cur.prev = node

    def search(self, item):
        """查找元素"""
        cur = self.__head
        while cur is not None:
            if cur.item == item:
                return True
            else:
                cur = cur.next
        return False

    def remove(self, item):
        """删除元素"""
        cur = self.__head
        pre = None
        while cur is not None:
            if cur.item == item:
                if cur == self.__head:   # 头部
                    self.__head = cur.next
                    if cur.next:
                        cur.next.prev = None
                else:
                    cur.next.prev = cur.prev
                    cur.prev.next = cur.next
                return True
            cur = cur.next
        return False


if __name__ == '__main__':
    dl = DLinkList()
    print(dl.is_empty())   # True

    dl.add('元素1')
    dl.add('元素2')         
    dl.append('元素3')
    dl.append('元素4')    
    dl.travel()            # 元素2	元素1	元素3	元素4
    print(dl.length())     # 4

    dl.insert(1, '元素n')   
    dl.travel()            # 元素2	元素n	元素1	元素3	元素4

    print(dl.search('元素n'))  # True

    dl.remove('元素1')  
    dl.travel()            # 元素2	元素n	元素3	元素4

单向循环链表

class Node(object):
    """链表节点"""

    def __init__(self, item):
        # item 存放数据元素
        self.item = item
        # next 存放下一个节点的标识
        self.next = None


class CycleSingleLinkList:
    """单向循环链表操作"""
    def __init__(self, node=None):
        self.__head = node

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

    def length(self):
        """链表长度"""
        if self.is_empty():
            return 0
        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
        cur = self.__head
        while cur.next != self.__head :
            print(cur.item, end='\t')
            cur = cur.next
        print(cur.item, end='\t')
        print()

    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
            node.next = self.__head
            self.__head = 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指向尾节点
            cur.next = node
            node.next = self.__head

    def insert(self, pos, item):
        """指定位置插入元素，第一个元素位置为0"""
        if pos <= 0:
            self.add(item)
        elif pos >= self.length():
            self.append(item)
        else:
            cur = self.__head
            count = 0
            while count < pos-1:
                count += 1
                cur = cur.next
            node = Node(item)
            node.next = cur.next
            cur.next = node

    def remove(self, item):
        """删除元素"""
        if self.is_empty():  # 链表为空
            return
        cur = self.__head
        pre = None
        while cur.next != self.__head:   # 非最后一个节点
            if cur.item == 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
                return
            else:
                pre = cur
                cur = cur.next
        if cur.item == item:             # 最后一个节点
            if cur == self.__head:  # 链表只有一个节点
                self.__head = None
            else:
                pre.next = self.__head
            return

    def search(self, item):
        """查找元素"""
        if self.is_empty():
            return False
        cur = self.__head
        while cur.next != self.__head:
            if cur.item == item:
                return True
            cur = cur.next
        # 在最后一个元素退出循环
        if cur.item == item:
            return True
        return False

    # # 单向循环链表-约瑟夫环
    # def josephu(self, k=None):
    #     count = 1
    #     cur = self.__head
    #     while not self.is_empty():
    #         if count == k:
    #             print(cur.item, end='\t')
    #             self.remove(cur.item)
    #             count = 0
    #         cur = cur.next
    #         count += 1


if __name__ == '__main__':
    single_link_list = CycleSingleLinkList()
    single_link_list.add('元素1')
    single_link_list.add('元素2')
    single_link_list.append('元素3')
    single_link_list.append('元素4')
    single_link_list.travel()            # 元素2	元素1	元素3	元素4
    print(single_link_list.length())     # 4

    single_link_list.insert(1, '元素n')
    single_link_list.travel()            # 元素2	元素n	元素1	元素3	元素4

    print(single_link_list.search('元素n'))   # True

    single_link_list.remove('元素1')
    single_link_list.travel()            # 元素2	元素n	元素3	元素4