摘要: 1005.K次取反后最大化的数组和 class Solution: def largestSumAfterKNegations(self, nums: List[int], k: int) -> int: nums.sort(key=lambda x: abs(x), reverse=True) f 阅读全文
posted @ 2024-04-22 12:12 MiraMira 阅读(18) 评论(0) 推荐(0)