class Solution(object): def minimumDifference(self, A, k): """ :type nums: List[int] :type k: int :rtype: int """ n = len(A) if n <= 1: return 0 A.sort() # print A ans = 10**5 for i in range(n-k+1): # print i, A[i] ans = min(ans, A[i+k-1]-A[i]) for j in range(n-1, k-1, -1): # print j, A[j] ans = ...