# Medium
Find the first postion and last position separately
class Solution { public int[] searchRange(int[] nums, int target) { int[] res = {-1, -1}; int left = 0; int right = nums.length - 1; while(left <= right) { int mid = left + (right - left)/2; if(nums[mid] >= target) { res[0] = mid; right = mid - 1; } else { left = mid + 1; } } left = 0; right = nums.length - 1; while(left <= right) { int mid = left + (right - left)/2; if(nums[mid] <= target) { res[1] = mid; left = mid + 1; } else { right = mid - 1; } } return res; } }
Last updated 3 years ago
Was this helpful?