Environment: Python 3.8
Key technique: sorted
Given an array
true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero). Otherwise, return
There may be duplicates in the original array.
Note: An array
A rotated by
x positions results in an array
B of the same length such that
A[i] == B[(i+x) % A.length], where
% is the modulo operation.
Input: nums = [3,4,5,1,2]
Explanation: [1,2,3,4,5] is the original sorted array.
You can rotate the array by x = 3 positions to begin on the the element of value 3: [3,4,5,1,2].
Input: nums = [2,1,3,4]
Explanation: There is no sorted array once rotated that can make nums.
- Sort nums as c_n.
- get c_n[1:-1]
- Check c_n is in nums
def check(self, nums):
if str(c_n)[1:-1] in str(nums):