561

· One step
LeetCode-561 Array Partition : find maximum (minimum list) note : len(list) = 2nmyAnswer :::python class Solution: def arrayPairSum(self, nums: List[int]) -> int: nums.sort() return sum(nums[::2]) Result : 267ms Memory: 16.7mb
다했다
'561' 태그의 글 목록