Java学习笔记——数组的高级操作与递归

二分查找思路分析

二分查找思路实现

package top.xxx.top.apidemo;

public class MybinarySearchDemo {
    public static void main(String[] args) {
        int[] arr = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int number = 3;
        int index = binarySearchForIndex(arr, number);
        System.out.println(index);
    }

    private static int binarySearchForIndex(int[] arr, int number) {
        int min = 0;
        int max = arr.length - 1;
        while (min <= max) {
            int mid = (min + max) / 2;
            if(arr[mid] > number){
                max = mid -1;
            }else if(arr[mid] < number){
                min = mid +1;
            }else{
                return mid;
            }
        }
        return -1;
    }
}

冒泡排序思路分析

冒泡排序代码实现

package top.xxx.top.apidemo;

public class MyMaoPaoDemo {
    public static void main(String[] args) {
        int[] arr = {5, 3, 1, 4, 2, 9, 6, 10, 8, 7};
        bubbleSort(arr);
        printArr(arr);
    }

    private static void bubbleSort(int[] arr) {
        for (int i = 0; i < arr.length - 1; i++) {
            //内层循环是实际比较循环的次数
            //-1是为了让索引不越界
            //-i 是每一轮循环结束后，我们就少比一个数字
            for (int j = 0; j < arr.length -1 -i; j++) {
                if (arr[j] > arr[j + 1]) {
                    int temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }
            }
        }
    }

    private static void printArr(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }
}

递归概念

从编程的角度来看，递归指的是方法定义中调用方法本身的现象.
举例，求1-100的和。

package top.xxxx.top.apidemo;

public class MyFactorialDemo1 {
    public static void main(String[] args) {
        int sum = getSum(100);
        System.out.println(sum);
    }

    private static int getSum(int i) {
        if(i == 1){
            return 1;
        }else{
            return i + getSum(i -1);
        }
    }
}

递归-求阶乘代码实现

package top.xxxx.top.apidemo;

public class MyFactorialDemo2 {
    public static void main(String[] args) {
        int num = getJieCheng(5);
        System.out.println(num);
    }

    private static int getJieCheng(int i) {
        if(i == 1){
            return 1;
        }else{
            return i * getJieCheng(i - 1);
        }
    }

}

递归-内存图

重点理解：当n = 1时，return 1，返回到了调用处，不断地向第一次调用方法的地方返回，就实现了递归。

快排核心思路分析

快排核心代码实现

package top.xxx.top.apidemo;

public class MyQuiteSortDemo {
    public static void main(String[] args) {
        int[] arr = {6, 8, 4, 5, 3, 2, 7, 9, 1, 10};
        quiteSort(arr, 0,arr.length -1 );
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    private static void quiteSort(int[] arr, int left, int right) {
        int left0 = left;
        int right0 = right;
        int baseNum = arr[left0];
        while(left != right){
            while(arr[right] >= baseNum && right > left){
                right --;
            }
            while(arr[left] <= baseNum && right > left){
                left ++;
            }
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
        }
        int temp = arr[left0];
        arr[left0] = arr[left];
        arr[left] = temp;
    }
}

快排完整实现

package top.xxx.top.apidemo;

public class MyQuiteSortDemo2 {
    public static void main(String[] args) {
        int[] arr = {6, 8, 4, 5, 3, 2, 7, 9, 1, 10};
        quiteSort(arr, 0,arr.length -1 );
        for (int i = 0; i < arr.length; i++) {
            System.out.print(arr[i] + " ");
        }
        System.out.println();
    }

    private static void quiteSort(int[] arr, int left, int right) {
        if(right < left){
            return;
        }
        int left0 = left;
        int right0 = right;
        int baseNum = arr[left0];
        while(left != right){
            while(arr[right] >= baseNum && right > left){
                right --;
            }
            while(arr[left] <= baseNum && right > left){
                left ++;
            }
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
        }
        int temp = arr[left0];
        arr[left0] = arr[left];
        arr[left] = temp;
        quiteSort(arr, left0, left -1);
        quiteSort(arr, left +1 , right0);
    }
}

Arrays

package top.xxxx.top.apidemo;

import java.util.Arrays;

public class MyArraysDemo {
    public static void main(String[] args) {
        //把数组的内容以字符串形式表示
        int[] arr = {5, 6, 3, 8, 1};
        String s = Arrays.toString(arr);
        System.out.println(s);

        //按照数字顺序排列指定的数组
        int[] arr2 = {7, 4, 8, 2, 9, 10, 4};
        Arrays.sort(arr2);
        System.out.println(Arrays.toString(arr2));

        //利用二分查找返回指定元素的索引
        int[] arr3 = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        System.out.println(Arrays.binarySearch(arr3, 2));
    }
}