Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

One test case is [1,3,3]. Is it a Rotated Sorted Array? How could it be?

Yes. It is.

I think there is two types of the array. {1,3,3} and {3,1,3}.

yes, it is.

[3, 3, 1] --> [1, 3, 3]

1 is rotated to the first place or the two 3s are rotated behind 1.

But the problem says it is a sorted array before rotated, such as [1, 3, 3, 4].

[1, 3, 3, 4] is ascending. [4, 3, 3, 1] is descending.

Doesn't the sorted array mean ascending array, just like other problems, such as Find Minimum in Rotated Sorted Array, Search in Rotated Sorted Array, Merge Sorted Array etc.?

The pivot can be the top left blank or the top right one, so the array is actually same as before rotating.

Got it, thanks

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.