java 数组元素倒序输出

代码块

int arr[] = {1,2,4,6,7};
int temp = 0;
for (int i = 0; i < arr.length; i++) {
temp = arr[i];
temp = arr[arr.length - 1 - i];
System.out.println(temp);
}

结果：7，6，4，2，1

二分法查找元素

int[] array = { 1, 2, 3, 4, 5, 6 };        int key = 6;        System.out.println(function(array, key));         --------------//定义一个方法public static int function(int[] array, int key) {        // 最小索引        int low = 0;        // 最大索引        int high = array.length - 1;        while (low <= high) {            // 中间索引            int mid = (low + high) / 2;            if (array[mid] > key) {                high = mid - 1;            } else if (array[mid] < key) {                low = mid + 1;            } else {                return mid;            }        }        return -1;    }