LeetCode：34. Search for a Range（Medium）

1. 原题链接

https://leetcode.com/problems/search-for-a-range/description/

2. 题目要求

给定一个按升序排列的整型数组nums[ ]和目标值target（int类型），如果数组中存在目标值，返回目标值在数组中的起始位置和结束位置，[start, end]。不存在返回 [-1, -1]。

3. 解题思路

思路一：暴力解决，遍历数组进行匹配，时间复杂度O( n )

4. 代码实现

package com.huiAlex;

public class SearchForARange34 {
    public static void main(String[] args) {
        int[] nums = {5, 7, 7, 8, 8, 8, 8, 10};
        int[] res = searchRange(nums, 8);
        for (int x : res)
            System.out.println(x);
    }

    public static int[] searchRange(int[] nums, int target) {
        int start, end, count;
        start = 0;
        end = 0;
        count = 0;
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] == target) {
                start = i;
                count++;
            }
            if (nums[i] > target) break;
        }

        if (count == 0) {
            start = -1;
            end = -1;
        } else {
            end = start;
            start -= count - 1;
        }
        return new int[]{start, end};
    }
}