|
| 1 | +package com.chen.algorithm.study.test34; |
| 2 | + |
| 3 | +import org.junit.Test; |
| 4 | + |
| 5 | +import java.util.Arrays; |
| 6 | + |
| 7 | +/** |
| 8 | + * @author : chen weijie |
| 9 | + * @Date: 2020-09-14 01:34 |
| 10 | + */ |
| 11 | +public class Solution3 { |
| 12 | + |
| 13 | + |
| 14 | + public int[] searchRange(int[] nums, int target) { |
| 15 | + |
| 16 | + int left = 0, right = nums.length - 1; |
| 17 | + int[] res = new int[2]; |
| 18 | + |
| 19 | + res[0] = leftIndex(target, nums); |
| 20 | + res[1] = rightIndex(target, nums); |
| 21 | + |
| 22 | + return res; |
| 23 | + } |
| 24 | + |
| 25 | + |
| 26 | + private int leftIndex(int target, int[] nums) { |
| 27 | + int left = 0, right = nums.length - 1; |
| 28 | + while (left <= right) { |
| 29 | + int mid = (right - left) / 2 + left; |
| 30 | + if (nums[mid] < target) { |
| 31 | + left = mid + 1; |
| 32 | + } else { |
| 33 | + right = mid - 1; |
| 34 | + } |
| 35 | + } |
| 36 | + if (left <= nums.length - 1 && nums[left] == target) { |
| 37 | + return left; |
| 38 | + } |
| 39 | + |
| 40 | + return -1; |
| 41 | + } |
| 42 | + |
| 43 | + private int rightIndex(int target, int[] nums) { |
| 44 | + int left = 0, right = nums.length - 1; |
| 45 | + while (left <= right) { |
| 46 | + int mid = (right - left) / 2 + left; |
| 47 | + if (nums[mid] <= target) { |
| 48 | + left = mid + 1; |
| 49 | + } else { |
| 50 | + right = mid - 1; |
| 51 | + } |
| 52 | + } |
| 53 | + if (right >= 0 && nums[right] == target) { |
| 54 | + return right; |
| 55 | + } |
| 56 | + |
| 57 | + return -1; |
| 58 | + } |
| 59 | + |
| 60 | + @Test |
| 61 | + public void testCase() { |
| 62 | + int[] nums = {5, 7, 7, 8, 8, 10}; |
| 63 | + int[] res = searchRange(nums, 8); |
| 64 | + System.out.println(Arrays.toString(res)); |
| 65 | + |
| 66 | + } |
| 67 | +} |
0 commit comments