程序界蔡徐坤

摘要： 二分查找法 int look = 5; int arr [] = new int[]{-5,-3,0,1,2,3,4,5,6}; //初始值的索引 int head = 0; //初始值的末索引 int end = arr.length-1; while(head<=end){ int middle 阅读全文