class Solution {
public boolean search(int[] nums, int target) {
if(nums.length==0) return false;
return helper(nums, 0, nums.length-1, target);
}
private boolean helper(int[] a, int lo, int hi, int target) {
System.out.println(lo+" "+hi);
if(lo>hi) return false;
int mid = (lo+hi)/2;
if(a[mid]==target) return true;
if(a[mid]>a[lo]) {
if(target>=a[lo] && target<=a[mid])
return helper(a, lo, mid-1, target);
else
return helper(a, mid+1, hi, target);
} else if(a[mid]<a[hi]) {
if(target>=a[mid] && target<=a[hi])
return helper(a, mid+1, hi, target);
else
return helper(a, lo, mid-1, target);
} else {
return helper(a, lo, mid-1, target) || helper(a, mid+1, hi, target);
}
}
public static void main(String[] args) {
Solution s=new Solution();
System.out.println(s.search(new int[]{1,3}, 3));
}
}
81. Search in Rotated Sorted Array II
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门,熙熙楼的掌柜王于贵愁眉苦脸地迎上来,“玉大人,你说我怎么就摊上这事。” “怎么了?”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着,像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上,一...
- 文/苍兰香墨 我猛地睁开眼,长吁一口气:“原来是场噩梦啊……” “哼!你这毒妇竟也来了?” 一声冷哼从身侧响起,我...
推荐阅读更多精彩内容
- 题目 Follow up for "Search in Rotated Sorted Array":What if...
- LeetCode 81 Search in Rotated Sorted Array II Follow up f...
- 原题 跟进“搜索旋转排序数组”,假如有重复元素又将如何? 给出[3,4,4,5,7,0,1,2]和target=4...