xf-阿飞大大

# coding:utf-8def quick_sort(alist: list, first: int, last: int) -> list: """快速排序 :rtype: object """ if first >= last: return mid_value = alist[first] low = first high = last while low < high: #

冒泡排序python实现方式

class Dequeue(object): '''队列''' def __init__(self): self.__list = [] def add_front(self, item): """往队列中添加一个item元素""" self.__list.insert(0, item) def add_rear(self, item): """往队列中添加一个item元素""" self

栈用python的方式实现

双向链表,用python实现方式

#coding:utf-8class Node(object): '''节点''' def __init__(self, elem): self.elem = elem self.next = Noneclass SingleLinkList(object): '''单链表''' def __init__(self, node=None): self._head = node def is_empty.