在排序数组中查找元素的第一个和最后一个位置(Java)

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。

如果数组中不存在目标值，返回 [-1, -1]。

示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]

示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]

 

package com.loo;

import java.util.Arrays;

public class SearchIndex {
    public static void main(String[] args) {
        int[] arr = new int[]{ 1 , 3 , 4, 5 , 5 ,5 ,5 ,5, 7 };
        System.out.println(Arrays.toString(searchIndex1(arr , 5)));
        System.out.println(Arrays.toString(searchIndex2(arr , 5)));
        System.out.println(Arrays.toString(searchIndex3(arr , 5)));
    }

    // 遍历所有法, 时间复杂度： O(n); 空间复杂度： O(1)
    public static int[] searchIndex1(int[] arr , int target) {
        if (arr == null || arr.length == 0) {
            return new int[]{ -1 , -1 };
        }
        int left = -1;
        int right = -1;
        for (int i=0;i<arr.length;i++) {
            if (arr[i] == target && left == -1) {
                left = i;
            }
            if (left != -1 && arr[i] == target) {
                right = i;
            }
            if (right != -1 && (i < arr.length - 1) && arr[i] != arr[i+1]) {
                break;
            }
        }
        return new int[]{left , right};
    }

    // 二分查找, 时间复杂度： O(log⁡n)
    public static int[] searchIndex2(int[] arr , int target) {
        if (arr == null || arr.length == 0) {
            return new int[]{ -1 , -1 };
        }
        int start = 0;
        int end = arr.length - 1;
        int left = -1;
        int right = -1;
        while (start <= end) {
            int mid = start + (end - start)/2;
            if (arr[start] == target) {
                if (left == -1 || start < left) {
                    left = start;
                }
                if (right == -1 || start > right) {
                    right = start;
                }
            }
            if (arr[end] == target) {
                if (end == -1 || right < end) {
                    right = end;
                }
                if (left == -1 || left > end) {
                     left = end;
                }
            }
            if (arr[mid] == target) {
                if (mid < left) {
                    left = mid;
                }
                if (mid > right) {
                    right = mid;
                }
                start++;
                end--;
            } else if (arr[mid] < target) {
                start = mid + 1;
                end--;
            } else if (arr[mid] > target) {
                end = mid - 1;
                start++;
            }
        }
        if (left == -1) {
            return new int[]{right , right};
        } else if (right == -1) {
            return new int[]{left , left};
        } else if (left != -1 && right != -1) {
            return new int[]{left , right};
        }
        return new int[]{-1 , -1};
    }

    // 二分查找, 时间复杂度： O(log⁡n)
    public static int[] searchIndex3(int[] arr , int target) {
        if (arr == null || arr.length == 0) {
            return new int[]{ -1 , -1 };
        }
        int[] range = new int[]{-1 , -1};
        int left = findTargetIndex(arr , target , true);
        if (left == arr.length || arr[left] != target) {
            return range;
        }
        range[0] = left;
        range[1] = findTargetIndex(arr , target , false) - 1;
        return range;
    }

    public static int findTargetIndex(int[] arr , int target , boolean isLeft) {
        int start = 0;
        int end = arr.length;
        while (start < end) {
            int mid = start + (end - start)/2;
            if (arr[mid] > target || (isLeft && arr[mid] == target)) {
                end = mid;
            } else {
                start = mid + 1;
            }
        }
        return start;
    }
}