[Must Review] Dealing with middle area

kaestro · May 1, 2024 · eb87856 · eb87856
1 parent a5a04cd
commit eb87856
Showing 1 changed file with 9 additions and 0 deletions.
diff --git a/Daily Practices/May/Week 1st/[Must Review]2717 - LeetCode.py b/Daily Practices/May/Week 1st/[Must Review]2717 - LeetCode.py
@@ -0,0 +1,9 @@
+# https://leetcode.com/problems/semi-ordered-permutation/description/
+
+from typing import List
+
+class Solution:
+    def semiOrderedPermutation(self, nums: List[int]) -> int:
+        n = len(nums)
+        i, j = nums.index(1), nums.index(n)
+        return i + n - 1 - j - (i > j)