LeetCode——Search in Rotated Sorted Array II

標籤：leetcode

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.

原題連結：https://oj.leetcode.com/problems/search-in-rotated-sorted-array-ii/

題目：繼續之前的題，在旋轉過的有序數組中找目標值。若允許有重複的值呢？

public boolean search(int[] A, int target) {int low = 0, high = A.length - 1;while (low <= high) {int mid = (low + high) / 2;if (target == A[mid])return true;if (A[mid] > A[low]) {if (target >= A[low] && target <= A[mid])high = mid - 1;elselow = mid + 1;} else if (A[mid] < A[low]) {if (target >= A[mid] && target <= A[high])low = mid + 1;elsehigh = mid - 1;} elselow += 1;}return false;}