leetcode-192周赛-1471-数组中的K个最强值
题目描述:
提交:
class Solution: def getStrongest(self, arr: List[int], k: int) -> List[int]: arr = sorted(arr) m = arr[(len(arr) - 1) // 2] res = [] tmp = sorted(arr, key=lambda x: (-abs(x - m),-x)) for i in tmp[:k]: res.append(i) return res