dream

[code="java"]public class KMPProcess { public static void buildNext(String str, int[] next) { if (str == null || next == null || str.length() != next.length) throw new IllegalArgumentEx...

自己复习下基础，做下记录。。。[code="java"]public class QSort { public static void qsort(int[] values, int start, int end) { if (start < 0 || start >= end || values == null || values.length i && value...

[code="java"]public class MergeSort { public static int[] merge(int[] arr1, int[] arr2) { int[] temp = new int[arr1.length + arr2.length]; int start1 = 0; int start2 = 0; int en...

just 复习些概念，写写点代码。。。[code="java"]public static int f (int n) { if (n == 0) return 0; if (n == 1) return 1; return f(n - 1) + f(n - 2); } public static int f1 (int n) {...

[code="java"]public class Heapsort { public static int[] Heap = { 10, 32, 1, 9, 5, 7, 12, 0, 4, 3 }; // 预设数据数组 public static void buildMaxHeap(int[] heap, int start, int end) { if (heap =...

给一个参数n，求这个数的所有整数求和排列，不允许有重复简单解答，算法还有优化空间[code="java"]public static void main(String[] args) { int n = 10; int[] pre = new int [(int)Math.sqrt(2 * n)]; p1(n, 1, pre, 0); ...

输出整个过程[code="java"] public static void process(int n, int m) { if (n