leetcode33---Search in Rotated Sorted Array
2016-01-22 15:16
459 查看
问题描述:
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
特点:数组中没有重复数字
问题求解:
Suppose a sorted array is rotated at some pivot unknown to you beforehand.
(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).
You are given a target value to search. If found in the array return its index, otherwise return -1.
You may assume no duplicate exists in the array.
特点:数组中没有重复数字
问题求解:
class Solution { public: int search(vector<int>& nums, int target) { int n=nums.size(); if(n==0) return -1; int low=0, high=n-1, mid; while(low<=high) { mid=(low+high)/2; if(nums[mid]==target) return mid; else if(nums[low]<=nums[mid])// { if(target<nums[mid] && target>=nums[low]) { high=mid-1; } else { low=mid+1; } } else { if(target<=nums[high] && target>nums[mid]) { low=mid+1; } else { high=mid-1; } } } return -1; } };
相关文章推荐
- 快速排序里的学问:从猜数字开始
- HDU 4898 The Revenge of the Princess’ Knight ( 2014 Multi-University Training Contest 4 )
- Search Insert Position,Search for a Range,Pow(x, n),Sqrt(x)
- Find Minimum in Rotated Sorted Array II
- [LeetCode] Sqrt(x)
- [LeetCode] Pow(x, n)
- [LeetCode] Search Insert Position
- [LeetCode] Search for a Range
- [LeetCode] Search in Rotated Sorted Array
- PAT 1057 Stack (30)
- int sqrt(int x)
- Pow(x, n)
- Find Minimum in Rotated Sorted Array
- Divide Two Integers
- 信息竞赛学习笔记:POJ3579中位数(二分)
- acm解题报告 HDU 2141 Can you find it?
- acm解题报告 HDU 2199 Can you solve this equation?
- acm解题报告 HDU 2899 Strange fuction
- acm解题报告 HDU 1969 Pie
- acm解题报告 HDU 1061 Rightmost Digit