Update missing-element-in-sorted-array.py

Author: kamyu104

Python/missing-element-in-sorted-array.py

@@ -11,15 +11,15 @@ def missingElement(self, nums, k):
         def missing_count(nums, x):
             return (nums[x]-nums[0]+1)-(x-0+1)
 
-        def check(nums, x, k):
+        def check(nums, k, x):
             return k <= missing_count(nums, x)
 
         left, right = 0, len(nums)-1
         while left <= right:
             mid = left + (right-left)//2
-            if check(nums, mid, k):
+            if check(nums, k, mid):
                 right = mid-1
             else:
                 left = mid+1
-        assert(not check(nums, right, k))
+        assert(not check(nums, k, right))
         return nums[right] + (k-missing_count(nums, right))