561.Array Partition 1
Given an array of 2n integers, your task is to group these integers
into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn)
which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
Example 1:
Input: [1,4,3,2]
Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
Note:
n is a positive integer, which is in the range of [1, 10000].
All the integers in the array will be in the range of [-10000, 10000].
题目:数组拆分 1
给定长度为2n的数组,你的任务是将这些数组分成n对,例如(a1,b1),(a2,b2) ... (an,bn),使得从1到n的min(ai,bi)总和最大。
解题思路:先将数据排序,,然后间隔为2遍历数组,和相加即为最小值。
/**
* @param {number[]} nums
* @return {number}
*/
var arrayPairSum = function(nums) {
const arrSorting = nums.sort((a,b) => {return a-b});
let sum = 0;
for(i=0; i<arrSorting.length; i+=2){
sum += arrSorting[i];
}
return sum;
};