C# 代码
public class Solution {
public int SemiOrderedPermutation(int[] nums) {
int n = nums.Length;
int first = Array.IndexOf(nums, 1);
int last = Array.IndexOf(nums, n);
return first + n - 1 - last - (first > last ? 1 : 0);
}
}