摘要:
public class BinarySearch { //递归 public static int findData(int[] a, int b, int beginIndex, int endIndex) { if(a.length == 0 || a == null) { return 0; 阅读全文
摘要:
public class FindNum { public static boolean findANum(int[][] array, int target) { int row = array.length;//行数 int cloumn = array[0].length;//列数 int i 阅读全文
摘要:
public class QuickSort { public static int getMidIndex(int[] list, int low, int high) { int temp = list[low]; while(low < high) { while(low<high && li 阅读全文