561 Array Partition

1. Description

Given an integer array nums of 2n integers, group these integers into n pairs \((a_1, b_1), (a_2, b_2), ..., (a_n, b_n)\) such that the sum of \(min(a_i, b_i)\) for all i is maximized. Return the maximized sum.

 

constraints :

• 1 <= n <= \(10^{4}\)
• nums.length == 2 * n
• \(-10^{4}\) <= nums[i] <= \(10^{4}\)

 

2. Algorithms

1. Start
2. Sort the input list.
3. Store the length of input list in variable named n.
4. Declare variable sum_ initialized with 0.
5. Repeat the steps through integers 0 to n - 1 every 2 decimals.
   1. Increment sum_ by nums[i].
6. Return sum_.
7. End

 

3. Codes

class Solution:
    def arrayPairSum(self, nums: List[int]) -> int:
        nums = sorted(nums) 
        n = len(nums) 
        sum_ = 0 
        
        for i in range(0, n, 2) : 
            sum_ += nums[i]
        return sum_

 

4. Conclusion