Leetcode 34. Search for a Range (Medium) (java)

Leetcode 34. Search for a Range (Medium) (java)

Tag: Array, Binary Search

Difficulty: Medium

/*34. Search for a Range (Medium)Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found in the array, return [-1, -1].For example,Given [5, 7, 7, 8, 8, 10] and target value 8,return [3, 4].*/public class Solution {public int[] searchRange(int[] nums, int target) {int l = 0, r = nums.length - 1;int[] res = {-1, -1};while (l <= r) {int mid = l + (r - l) / 2;if (nums[mid] < target) {l = mid + 1;}else if (target < nums[mid]) {r = mid - 1;}else {while (nums[l] != target) l++;while (nums[r] != target) r--;res[0] = l;res[1] = r;return res;}}return res;}}