JuniorArray
Minimum Right Shifts to Sort the Array
You are given a 0-indexed array nums of length n containing distinct positive integers. Return the minimum number of right shifts required to sort nums, or -1 if this is not possible.
A right shift is defined as shifting the element at index i to index (i + 1) % n, for all indices.
Example 1
Input
nums = [3,4,5,1,2]Output
2After two right shifts, nums becomes [1, 2, 3, 4, 5], so the answer is 2.
Example 2
Input
nums = [1,3,5]Output
0nums is already sorted, so the answer is 0.
Constraints
- 1 <= nums.length <= 100
- 1 <= nums[i] <= 100
- nums contains distinct integers.