search-in-rotated-sorted-array-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

There is an integer array <code>nums</code> sorted in non-decreasing order (not necessarily with distinct values).

Before being passed to your function, <code>nums</code> is rotated at an unknown pivot index <code>k</code> (<code>0 &lt;= k &lt; nums.length</code>) such that the resulting array is <code>[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]</code> (0-indexed). For example, <code>[0,1,2,4,4,4,5,6,6,7]</code> might be rotated at pivot index <code>5</code> and become <code>[4,5,6,6,7,0,1,2,4,4]</code>.

Given the array <code>nums</code> after the rotation and an integer <code>target</code>, return <code>true</code> if <code>target</code> is in <code>nums</code>, or <code>false</code> if it is not in <code>nums</code>.

You must decrease the overall operation steps as much as possible.

&nbsp;
Example 1:
<pre>Input: nums = [2,5,6,0,0,1,2], target = 0
Output: true
</pre>Example 2:
<pre>Input: nums = [2,5,6,0,0,1,2], target = 3
Output: false
</pre>
&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 5000</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> is guaranteed to be rotated at some pivot.</li>
	<li><code>-104 &lt;= target &lt;= 104</code></li>
</ul>

&nbsp;
Follow up: This problem is similar to&nbsp;<a href="/problems/search-in-rotated-sorted-array/description/" target="_blank">Search in Rotated Sorted Array</a>, but&nbsp;<code>nums</code> may contain duplicates. Would this affect the runtime complexity? How and why?