算法
八月的猪猪
就想做个全栈...
展开
-
快速排序
# coding=utf-8 from random import randint def quick_sort(array): quick_sort_helper(array, 0, len(array) - 1) def quick_sort_helper(array, left, right): if left >= right: return...原创 2019-05-17 18:38:19 · 117 阅读 · 0 评论 -
堆排序
# 升序:构建大顶堆 from collections import deque def swap_param(L, i, j): L[i], L[j] = L[j], L[i] return L def heap_adjust(L, start, end): temp = L[start] i = start j = 2 * i ...原创 2019-05-17 18:34:22 · 100 阅读 · 0 评论 -
归并排序
# coding=utf-8 def merge_sort(array): merge_sort_helper(array, 0, len(array) - 1) def merge_sort_helper(array, left, right): if left >= right: return mid = (left + right) /...原创 2019-05-17 18:36:24 · 117 阅读 · 0 评论 -
两个队列实现栈
# 自己的方法: class Stack: """ @param: x: An integer @return: nothing """ def __init__(self): from queue import Queue self.que1 = Queue() def push...原创 2019-05-17 18:42:41 · 100 阅读 · 0 评论 -
两个栈实现队列
# 自己的方法: class MyQueue: def __init__(self): # do intialization if necessary self.stack1 = Stack() self.stack2 = Stack() """ @param: element: An integer @retur...原创 2019-05-17 18:44:29 · 104 阅读 · 0 评论 -
普通排序
# 普通排序(3种): # 选择排序 def selection_sort(arr): for i in range(len(arr)): min_index = i for j in range(i+1,len(arr)): if arr[j] < arr[min_index]: min_ind...原创 2019-05-17 18:46:05 · 286 阅读 · 0 评论