问题:
Follow up for “Search in Rotated Sorted Array”:
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
思路一:对于一个有序的,又重复元素的数组旋转后查找目标值,如果不考虑时间复杂度,可以用数组中的元素依次与目标值进行比较,找到是否存在目标值。
思路二:与前述的没有重复元素的数组解决方法类似,采用二分查找的递归方法,不过由于存在重复元素,无法判断数组哪侧有序,需要两侧都进行判断再比较。
class Solution {
public boolean search(int[] nums, int target) {
int len = nums.length;
if(len==0){
return false;
}
return dfs(nums,target,0,len-1);
}
public boolean dfs(int []nums,int target,int min,int max){
if(min>max){
return false;
}
int mid = (min+max)/2;
if(nums[mid]==target){
return true;
}
boolean left ;
boolean right;
left = dfs(nums,target,min,mid-1);
right = dfs(nums,target,mid+1,max);
return (left || right);
}
}