数组和字符串笔记01 - 数组

1.寻找数组的中心索引
题目: https://www.cnblogs.com/pauljoyce/p/9418880.html

demo:

    /**
     * 寻找数组的中心索引
     * 思路:先计算和;
     * 左边和 + 右边和 + 当前索引数值 = 总和
     * 因为左边和要等于右边和,所以2 * 左边和 + 当前索引值 = 总和
     */
    private static int getCenterIndex(int[] arr) {
        int sum = Arrays.stream(arr).sum();

        int length = arr.length;
        int sumLeft = 0;
        for (int i = 0; i < length; i++) {
            if (i != 0) {
                sumLeft += arr[i - 1];
            }
            int sumLeft2 = sumLeft << 1;
            if (sumLeft2 + arr[i] == sum) {
                return i;
            }
        }

        return -1;
    }

测试:

    public static void main(String[] args) {
        System.out.println(getCenterIndex(new int[]{1, 2, 0, 0, -1, 4}));
        System.out.println(getCenterIndex(new int[]{1, 0}));
        System.out.println(getCenterIndex(new int[]{1}));
    }

2.搜索插入位置
题目: https://www.jianshu.com/p/a0c92186830e

demo:

  /**
     * 二分法搜索插入位置
     */
    private static int getIInsertIndex(int[] arr, int num) {
        int startIndex = 0;
        int endIndex = arr.length - 1;
        while (true) {
            int halfIndex = (startIndex + endIndex) >> 1;

            // num存在,则返回当前索引
            if (arr[halfIndex] == num) {
                return halfIndex;
            }

            //剩下1个数
            if (startIndex == endIndex) {
                return arr[startIndex] > num ? startIndex : startIndex + 1;
            }

            // 剩下2个数
            if (startIndex + 1 == endIndex) {
                if (num <= arr[startIndex]) {
                    return startIndex;
                } else if (num <= arr[endIndex]) {
                    return endIndex;
                } else {
                    return endIndex + 1;
                }
            }

            // 前半部分
            if (arr[halfIndex] > num) {
                endIndex = halfIndex - 1;
            } else if (arr[halfIndex] < num) {
                //后半部分
                startIndex = halfIndex + 1;
            }
        }
    }

测试:

    public static void main(String[] args) {
        int[] arr = new int[]{1, 3, 5, 7, 9};
        for (int i = 0; i < 12; i++) {
            System.out.print(getIInsertIndex(arr, i) + "\t");
        }
        System.out.println();
    }

3.合并区间
题目:https://blog.csdn.net/qq_40697071/article/details/86673707

demo:

   /**
     * 合并数组区间:
     * 思路:将数组拆分成2个数组,并分别按照顺序排序
     * 核心:左边值小于等于右边值,则进行合并
     */
    public static int[][] merge(int[][] arr) {
        int length = arr.length;
        int[] leftArr = new int[length];
        int[] rightArr = new int[length];
        for (int i = 0; i < length; i++) {
            leftArr[i] = arr[i][0];
            rightArr[i] = arr[i][1];
        }
        Arrays.sort(leftArr);
        Arrays.sort(rightArr);

        int[][] newArr = new int[length][2];
        int newArrIndex = 0;
        int index = 1;
        newArr[newArrIndex][0] = leftArr[newArrIndex];
        newArr[newArrIndex][1] = rightArr[newArrIndex];
        while (index < length) {
            if (leftArr[index] <= newArr[newArrIndex][1]) {
                newArr[newArrIndex][1] = rightArr[index];
            } else {
                newArrIndex++;
                newArr[newArrIndex][0] = leftArr[index];
                newArr[newArrIndex][1] = rightArr[index];
            }
            index++;
        }
        newArr = Arrays.copyOf(newArr, newArrIndex + 1);

        return newArr;
    }

测试:

    public static void main(String[] args) {
        int[][] newArr = merge(new int[][]{{1, 3}, {2, 6}, {8, 10}, {15, 18}});
        for (int[] ints : newArr) {
            System.out.print(ints[0] + "\t");
            System.out.println(ints[1]);
        }
    }

5.文章参考链接
a. https://www.cnblogs.com/pauljoyce/p/9418880.html
b.https://blog.csdn.net/wanger694243644/article/details/116097236
c.https://blog.csdn.net/qq_40697071/article/details/86673707