本文共 1100 字，大约阅读时间需要 3 分钟。

class Solution:    def truncateSentence(self, s, k):        list_s = s.split()        return ' '.join(list_s[:min(k, len(list_s))])

class Solution:    def minAbsoluteSumDiff(self, nums1: List[int], nums2: List[int]) -> int:        abs_arr = []        for i in range(len(nums1)):            abs_arr.append(abs(nums1[i]-nums2[i]))                max_descrease = 0        nums1.sort()        for i in range(len(nums2)):            close_num = self.find_close_fast(nums1, nums2[i])            max_descrease = max(max_descrease, abs_arr[i]-abs(close_num-nums2[i]))        return (sum(abs_arr) - max_descrease) % (10**9+7)        def find_close_fast(self, arr, e):        low = 0        high = len(arr) - 1        idx = -1        while low <= high:            mid = int((low + high) / 2)            if e == arr[mid] or mid == low:                idx = mid                break            elif e > arr[mid]:                low = mid            elif e < arr[mid]:                high = mid        if idx + 1 < len(arr) and abs(e - arr[idx]) > abs(e - arr[idx + 1]):            idx += 1        return arr[idx]