【LeetCode】561.Aray Partion 1(javascript版)

561.Aray Partion 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).

ノート:

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
長さ2 nの配列を与えられた場合、これらの配列をn対、例えば(a 1,b 1)、(a 2,b 2)…(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