摘要:
public class Main { public static void main(String[] args) { int [] a = {2,4,5,7,8,6,10} ; pack(14,a,0,new int[a.length]); } private static void pack(int total,int [] src,int offset,int [] bag){ if (t... 阅读全文
摘要:
public class Main { public static void main(String[] args) { System.out.println(power(3,18)); } //求x的y次幂 private static long power(long x, long y){ if ( y == 1) return x ; else { if (y % 2 == 1) retur... 阅读全文
摘要:
算法效率(O(N*LogN))优于冒泡,选择以及插入排序(O(N*N)),这里的实现效率不高,生成了大量临时数组,对于理解比较容易。public class Main { public static void main(String[] args) { int [] a = {9,8,7,6,5,4,3,2,1}; int [] b = mergeSort(a) ; for (int i:b) S... 阅读全文
摘要:
public class Main { public static void main(String[] args) { hanoi(4,'A','B','C'); } //将n个盘子从a经过b搬运到c上 private static void hanoi(int n, char a, char b , char c){ if ( n == 1) System.out.println(a + " ... 阅读全文
摘要:
public class Main { public static void main(String[] args) { System.out.println(common(25,100)); } private static int common(int m , int n){ if (m % n == 0) return n ; else return common(n,m%n); }}最小公... 阅读全文
摘要:
public class Main { private static char [] str = {'1','2','3','4'} ; public static void main(String[] args) { arrange(str.length); } private static void arrange(int size){ if (size == 1) { show(); ret... 阅读全文