Easy soln.
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    int semiOrderedPermutation(vector<int>& nums) {
        int x=0,y=0;
        int n= nums.size();

        for(int i=0;i<nums.size();i++){
            if(nums[i]==1){
                x=i;
            }
            if(nums[i]==n){
                y=i;
            }
            
        }
        
        return x<y?x+(n-y-1):x+(n-y-1)-1;
       
        
        
    }
};
```
['C++']