561. Array Partition I

最新推荐文章于 2020-02-21 01:18:00 发布

onefanyf

最新推荐文章于 2020-02-21 01:18:00 发布

阅读量74

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/qq_34471804/article/details/101006320

版权

leetcode 专栏收录该内容

77 篇文章 0 订阅

订阅专栏

#561. Array Partition I

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).

将所有的数字排序，然后取出第0，2，4…位的数字相加

function quickSort(arr) {
    if(arr.length<=1) {
        return arr;
    }  
    var pivotIndex=Math.floor(arr.length/2);
    var pivot=arr.splice(pivotIndex,1)[0];
    var left=[];
    var right=[];
    for(var i=0;i<arr.length;i++) {
        if(arr[i]<pivot) {
            left.push(arr[i]);
        }
        else{
            right.push(arr[i]);
        }
    }
    return quickSort(left).concat([pivot],quickSort(right));
};
var arrayPairSum = function(nums) {
    var newArr = quickSort(nums);
    var result = 0;
    for(var i=0;i<newArr.length;i++) {
        if(i%2===0) {
            result=result+newArr[i];
        }
    }
    return result;
};