Minimum Difference Between Largest and Smallest Value in Three Moves LeetCode solution in Python

1
# Runtime: 942 ms (Top 5.03%) | Memory: 24.7 MB (Top 96.65%)
2
class Solution:
3
    def minDifference(self, nums: List[int]) -> int:
4
        if len(nums) <= 3:
5
            return 0
6

7
        nums.sort()
8
        t1 = nums[-1] - nums[3]
9
        t2 = nums[-4] - nums[0]
10
        t3 = nums[-2] - nums[2]
11
        t4 = nums[-3] - nums[1]
12

13
        return min(t1, t2, t3, t4)