C# 代码
public class Solution {
public int MinimumRightShifts(IList<int> nums) {
int n = nums.Count;
int count = nums[0] < nums[^1] ? 1 : 0, result = 0;
for (int i = 0; i < n - 1; i++){
if (nums[i] > nums[i + 1]){
count++;
if (count > 1) return -1;
result = n - i - 1;
}
}
return result;
}
}