81.Search in Rotated Sorted Array II
class Solution {
public:
bool search(int A[], int n, int target) {
if (n == 0) return false;
int left = 0, right = n - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (A[mid] == target) return true;
else if (A[mid] < A[right]) {
if (A[mid] < target && A[right] >= target) left = mid + 1;
else right = mid - 1;
} else if (A[mid] > A[right]){
if (A[left] <= target && A[mid] > target) right = mid - 1;
else left = mid + 1;
} else --right;
}
return false;
}
};
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步