题目:
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
(i.e., [0,0,1,2,2,5,6]
might become [2,5,6,0,0,1,2]
).
You are given a target value to search. If found in the array return true
, otherwise return false
.
Example 1:
Input: nums = [2,5,6,0,0,1,2], target = 0 Output: true
Example 2:
Input: nums = [2,5,6,0,0,1,2], target = 3 Output: false
Follow up:
- This is a follow up problem to Search in Rotated Sorted Array, where
nums
may contain duplicates. - Would this affect the run-time complexity? How and why?
描述:
某个包含重复元素的数组循环移动一定位置,判断某元素是否在数组中出现
分析:
跟之前谋道题比较像(题目在这里),本来想用这种二分的思路,一直不对,还是用线性时间吧。。。
代码:(时间复杂度O(n))
class Solution {
public:
bool search(vector<int>& nums, int target) {
if (!nums.size()) {
return false;
}
for (int i = 0; i < nums.size(); ++ i) {
if (nums[i] == target) {
return true;
}
}
return false;
}
};