https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/

解決方案

class Solution {public int[] searchRange(int[] nums, int target) {int leftIdx = binarySearch(nums, target, 0, true);return new int[]{leftIdx, binarySearch(nums, target, leftIdx, false)};}public int binarySearch(int[] nums, int target, int left, boolean lower) {if (left == -1) {return -1;}int ans = -1;int right = nums.length - 1;while (left <= right) {int mid = (left + right) / 2;if (nums[mid] == target) {if (lower) {right = mid - 1;} else {left = mid + 1;}ans = mid;} else if (nums[mid] > target) {right = mid - 1;} else {left = mid + 1;}}return ans;} }

總結

以上是生活随笔為你收集整理的LeetCode 34 在排序数组中查找元素的第一个和最后一个位置的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。