[leetcode-561] Array Partition
ยท
๐Ÿข 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' ํƒœ๊ทธ์˜ ๊ธ€ ๋ชฉ๋ก