1403. Minimum Subsequence in Non-Increasing Order 链接到标题 对数组进行排序，然后依次取出当前最大值，比较当前取出数值和与剩余数值和，如果大于，则返回取出数字。 class Solution: def minSubsequence(self, nums: List[int]) -> List[int]: N = len(nums) total = sum(nums) nums.sort() ret = [] t = 0 while True: x = nums.pop() t += x ret.append(x) if t * 2 > total: return ret 1400. Construct K Palindrome Strings 链接到标题 构造指定个数的回文字符串，检查出现次数为奇数的字母次数是否超过了k即可。可以直接用 Counter 计算。 class Solution: def canConstruct(self, s: str, k: int) -> bool: digit_count = {} if len(s) < k: return False elif len(s) == k: return True else: odd = 0 for i in set(s): digit_count[i] = s.