33. Search in Rotated Sorted Array
2017-09-23 13:08
375 查看
public class Solution {
public int search(int[] nums, int target) {
int l=0;
int r=nums.length-1;
while(l<r)
{
int m=l+(r-l)/2;
if(nums[m]==target)
return m;
if(nums[l]<=nums[m])
{
if(nums[l]<=target&&target<nums[m])
r=m-1;
else
l=m+1;
}
else
{
if(nums[m]<target&&target<=nums[r])
l=m+1;
else
r=m-1;
}
}
return l<=r&&nums[l]==target?l:-1;
}
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode-33.Search in Rotated Sorted Array.
- LeetCode 33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II
- LeetCode 33. Search in Rotated Sorted Array
- 33. Search in Rotated Sorted Array（无敌2分）
- leetcode 33. Search in Rotated Sorted Array
- 【LEETCODE】33-Search in Rotated Sorted Array [Python]
- [Leetcode 88] 33 Search in Rotated Sorted Array
- leetcode 33. Search in Rotated Sorted Array __java
- Leetcode||33. Search in Rotated Sorted Array
- Java [leetcode 33]Search in Rotated Sorted Array
- LeetCode-33.Search in Rotated Sorted Array
- leetcode-33-Search in Rotated Sorted Array
- 33. Search in Rotated Sorted Array
- leetcode题解-33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II
- 33. Search in Rotated Sorted Array
- LeetCode 33 — Search in Rotated Sorted Array（C++ Java Python）
- [LeetCode]33. Search in Rotated Sorted Array
- Leetcode刷题记—— 33. Search in Rotated Sorted Array(在翻转顺序的数组里查找)
- LeetCode *** 33. Search in Rotated Sorted Array
- 【Leetcode】33. Search in Rotated Sorted Array