Magician Blog

排序面试题一、快速排序def partition(arr, begin, end): pivot = end counter = begin for i in range(begin, end): if arr[i] < arr[pivot]: arr[counter], arr[i] = arr[i], arr[counter] counter += 1 arr[counter], arr[piv

二叉树面试题

哈希表、集合