Search in rotated sorted array-II

Use the rotated-array search from the distinct-value version, with one essential ambiguity rule. If nums[low], nums[mid], and nums[high] are all equal, neither half can be identified as strictly sorted, so increment low and decrement high. Otherwise, if the left half is sorted, test whether target lies in its inclusive range and choose the proper half; if not, use the symmetric right-half rule. Always check nums[mid] before deciding branches. Shrinking equal boundaries preserves correctness because those boundary values were already checked against target, but it can discard only one value per iteration. Therefore average behavior is often logarithmic, yet the guaranteed worst case is O(n), for example an array of many equal values with one different pivot. Extra space remains O(1). Explicitly state this degradation instead of claiming O(log n) under duplicates.