Gary Lai
  • Home
  • About
Sign in Subscribe

561. Array Partition

Last updated on  Jun 7, 2023

561. Array Partition

class Solution:
    def arrayPairSum(self, nums: List[int]) -> int:
        nums.sort()
        
        res = 0
        i = 0
        
        while i < len(nums):
            res += nums[i]
            i += 2
            
        return res
Previous 724. Find Pivot Index
Next 151. Reverse Words in a String
Gary Lai © 2025
  • Sign up
Powered by Ghost