描述

給定一個(gè)包含 n 個(gè)整數(shù)的排序數(shù)組，找出給定目標(biāo)值 target 的起始和結(jié)束位置。
如果目標(biāo)值不在數(shù)組中，則返回[-1, -1]

樣例

給出[5, 7, 7, 8, 8, 10]和目標(biāo)值 target=8,
返回[3, 4]
給出[1]和目標(biāo)值target=1,
返回[0,0]

相關(guān)題目

目標(biāo)出現(xiàn)次數(shù)總和

代碼實(shí)現(xiàn)

public class Solution {
    /** 
     *@param A : an integer sorted array
     *@param target :  an integer to be inserted
     *return : a list of length 2, [index1, index2]
     */
    public int[] searchRange(int[] A, int target) {
        int[] result = new int[2];
        if (A == null || A.length == 0) {
            result[0] = -1;
            result[1] = -1;
            return result;
        }
        if (A.length == 1 && A[0] == target) {
            result[0] = 0;
            result[1] = 0;
            return result;
        }
        int start = 0;
        int end = A.length - 1;
        while (start + 1 < end) {
            int mid = start + (end - start) / 2;
            if (A[mid] < target) {
                start = mid;
            } else  {
                end = mid;
            } 
        }
        if (A[start] == target) {
            result[0] = start;
            for (int i = A.length-1; i >= start; i--) {
                if (A[i] == target) {
                    result[1] = i;
                    return result;
                }
            }
            result[1] = start;
            return result;
        }
        else if (A[end] == target) {
            result[0] = end;
            for (int i = A.length-1; i >= end; i--) {
                if (A[i] == target) {
                    result[1] = i;
                    return result;
                }
            }
            result[1] = end;
            return result;
        } else {
            result[0] = -1;
            result[1] = -1;
            return result;
        }
    }
}