Simplest solution in java beats 💯✅
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int semiOrderedPermutation(int[] nums) {\n        int c=0;\n        while(nums[0]!=1){\n        for(int i=0;i<nums.length;i++){\n            if(nums[i]==1){\n                int t=nums[i];\n                nums[i]=nums[i-1];\n                nums[i-1]=t;\n                c++;\n                break;\n\n            }\n        }\n        }\n        while(nums[nums.length-1]!=nums.length){\n        for(int i=0;i<nums.length;i++){\n            if(nums[i]==nums.length){\n                int t=nums[i];\n                nums[i]=nums[i+1];\n                nums[i+1]=t;\n                c++;\n                break;\n\n            }\n        }\n        }\n        return c;\n        \n        \n    }\n}\n```
['Java']