江湖18号分舵总舵主的博客

public static int calK(int n, int k) { if (k > n) { return 0; } int target = 1; for (int i = 2; i <= k; i++) { target = next(target, n...

public static void heapSort(int[] A) { int len = A.length; int start = len / 2 - 1; for (int i = start; i >= 0; --i) { siftDown(A, i); } } ...