首页 > 代码库 > Search in Rotated Sorted Array II
Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":
What if duplicates are allowed?
Would this affect the run-time complexity? How and why?
Write a function to determine if a given target is in the array.
C++代码实现：
#include<iostream>using namespace std;class Solution{public: bool search(int A[], int n, int target) { int i; for(i=0;i<n;i++) { if(target==A[i]) return true; } return false; }};int main(){ Solution s; int A[10]= {2,3,4,5,6,7,8,9,10,1}; cout<<s.search(A,10,5)<<endl;}
Search in Rotated Sorted Array II
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。