首页 > 代码库 > Leetcode Search in Rotated Sorted Array II
Leetcode 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.
class Solution {public: bool search(int A[], int n, int target) { int left = 0, right = n-1; while(left <= right){ int mid = left+(right-left)/2; if(A[mid] == target) return true; if(A[left]< A[mid]){ if(A[left] <=target && A[mid] > target) right = mid-1; else left = mid+1; }else if(A[left] > A[mid]){ if(A[mid] < target && target <= A[right]) left = mid+1; else right =mid-1; }else left++; } return false; }};
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。