Array Partition LeetCode solution in JavaScript

1
var arrayPairSum = function (nums) {
2
nums.sort((a, b) => a - b);
3
let total = 0;
4
for (let i = 0; i < nums.length; i += 2) {
5
total += Math.min(nums[i], nums[i + 1]);
6
}
7
return total;
8
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0