1、部分排序(过77%超时,为啥?) def subSort(arr): if len(arr) < 2: return [-1,-1] lmax,rmin,l,r,n = arr[0],arr[-1],-1,-1,len(arr) for i in range(n): if arr[i] < lmax: r = i lmax = max(lmax,arr[i]) if arr[n-1-i] > rmin: l = n-1-i rmin = min(rmin,...