题目
给定一个按照升序排列的整数数组 nums,和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
你的算法时间复杂度必须是 O(log n) 级别。
如果数组中不存在目标值,返回 [-1, -1]。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: [3,4]
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: [-1,-1]
题解
mid难度,思路非常简单,我发现二分查找的题目共性是考虑每次找到中点后的判定条件,但是编程过程中由于过长有很多细节出现了bug,以后要在做题前把思路写得更清晰以避免犯错
https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/solution/
class Solution {
public int[] searchRange(int[] nums, int target) {
/*思路:首先复杂度是O(logN)则确定了是用binary seach来查找,每次去中点然后分情况讨论
1.如果中点小于target证明target在右侧,left = mid
2.如果中点大于target证明target在左侧,right = mid;
3.如果中点等于target,则向两边分别for loop查找
*/
int[] res = new int[2];
if(nums.length == 0) return new int[]{-1,-1};
if(nums.length == 1){
if(nums[0] == target) return new int[]{0,0};
else return new int[]{-1,-1};
}
int left = 0;
int right = nums.length-1;
int mid = 0;
int start = 0;
int end = 0;
if(nums[0] == target){
res[0] = 0;
for(int i=0; i<nums.length; i++){
if(nums[i] == target) res[1] = i;
else{
break;
}
}
return res;
}else if(nums[nums.length-1] == target){
res[1] = nums.length-1;
for(int i=nums.length-1; i>0; i--){
if(nums[i] == target) res[0] = i;
else{
break;
}
}
return res;
}
while(left + 1< right){
mid = left + (right - left)/2;
if(nums[mid] == target){
for(int i=mid; i>0; i--){
if(nums[i] == target){
res[0] = i;
}else{
break;
}
}
for(int i=mid; i<nums.length; i++){
if(nums[i] == target){
res[1] = i;
}else{
break;
}
}
return res;
}else if(nums[mid] < target){
left = mid;
}else{
right = mid;
}
}
return new int[]{-1,-1};
}
}