基础算法代码

快速排序：

def quick_sort(lst):
    if not lst:
        return []
    pivot = lst[0]
    left = quick_sort([x for x in lst[1: ] if x < pivot])
    right = quick_sort([x for x in lst[1: ] if x >= pivot])
    return left + [pivot] + right

归并排序：

def merge_sort(lst):
    if len(lst) <= 1:
        return lst
    mid = len(lst) // 2
    left = merge_sort(lst[: mid])
    right = merge_sort(lst[mid:])
    return merge(left, right)
    
def merge(left, right):
    l, r, res = 0, 0, []
    while l < len(left) and r < len(right):
        if left[l] <= right[r]:
            res.append(left[l])
            l += 1
        else:
            res.append(right[r])
            r += 1
    res += left[l:]
    res += right[r:]
    return res

堆排序：

def heapify(array, idx):
    max_idx = idx
    left_idx = 2 * idx + 1
    right_idx = 2 * idx + 2
    if left_idx < arrlen and array[left_idx] > array[max_idx]:
        max_idx = left_idx
    if right_idx < arrlen and array[right_idx] > array[max_idx]:
        max_idx = right_idx
    if max_idx != idx:
        array[max_idx], array[idx] = array[idx], array[max_idx]
        heapify(array, max_idx)
        
def buildMaxHeap(array):
    middle = len(array) // 2
    for i in range(middle, -1, -1):
        heapify(array, i)

def heap_sort(array):
    global arrlen
    arrlen = len(array)
    buildMaxHeap(array)
    print(array)
    for i in range(len(array) - 1, 0, -1):
        array[i], array[0] = array[0], array[i]
        print(array)
        arrlen -= 1
        heapify(array, 0)
    return array

插入排序：

def insert_sort(self, data):
       for i in range(1, len(data)):
           value = data[i]  # 插入值    
           j = i-1 # 记录插入位置  j+1 代表插入的位置
           while j >= 0:    # 不用 for 循环是因为 j 为 -1 的情况
               if  data[j] > value:
                   data[j+1] = data[j]
               else :
                   break
               j -= 1
           data[j+1] = value
       return data

二分查找：

# 一般二分查找
def binsearch(lst, x):
    start, end = 0, len(lst)-1
    while start<= end:
        mid = (start+ end) // 2
        if lst[mid] < x:
            start = mid + 1
        elif lst[mid] > x:
            end = mid - 1
        else:
            return True
    return False

# 二分查找第一次出现index
def binsearch_get_lower(lst, x):
	start, end = 0, len(lst)-1
	mid = (start+end) // 2
	while start <= end:
		if lst[mid] < x:
			start = mid + 1
		else:
			end = mid - 1
		mid = (start+end) // 2
	return start

# 二分查找最后一次出现index
def bisearch_get_upper(lst, x):
	start, end = 0, len(lst)-1
	mid = (start+end) // 2
	while start <= end:
		if lst[mid] <= x:
			start = mid + 1
		else:
			end = mid - 1
		mid = (start+end) // 2
	return end

算法概念

前缀和

差分数组