Minimum Number of Operations to Make Array Continuous LeetCode solution in Python

1
class Solution:
2
    def minOperations(self, nums: List[int]) -> int:
3
        n = len(nums)
4
        nums = sorted(set(nums))
5
        end = 0
6
        ans = -1
7
        for i in range(len(nums)):
8
            while end < len(nums):
9
                if nums[i] + n > nums[end]:
10
                    end += 1
11
                else:
12
                    break
13
            ans = max(ans, end - i)
14
        return n - ans