class Solution {
public:
bool forward(vector<int>& nums, int target)
{
int max = nums.at(0);
for(int i=0;i<nums.size();i++)
{
if(nums.at(i)>=max)
{
max = nums.at(i);
if(nums.at(i) == target)
return true;
}
else
return false;
}
return false;
}
bool backward(vector<int>& nums, int target)
{
int size = nums.size();
int max = nums.at(size-1);
for(int i=size-1;i>=0;i--)
{
if(nums.at(i)<=max)
{
max = nums.at(i);
if(nums.at(i) == target)
return true;
}
else
return false;
}
return false;
}
bool search(vector<int>& nums, int target)
{
if(nums.size() == 0)
return false;
if(nums.size() == 1)
{
if(nums.at(0) == target)
return true;
else
return false;
}
if(target < nums.at(0))
return backward(nums,target);
else
return forward(nums,target);
}
};
LeetCode 81. 搜索旋转排序数组 II
最新推荐文章于 2024-10-07 19:01:55 发布