561. Array Partition I April 6, 2018 by omargamaleldeen 561. Array Partition I class Solution { public int arrayPairSum(int[] nums) { Arrays.sort(nums); int result = 0; for (int i = 0; i < nums.length; i += 2) { result += nums[i]; } return result; } } Share this:TwitterFacebookLike this:Like Loading... Related