leetcode--LinearList
2017-12-14 15:30:08
LeetCode LinearList easy-Level
561. Array Partition I
class Solution { public int arrayPairSum(int[] nums) { int sum = 0; Arrays.sort(nums); for(int i = 0; i < nums.length; i += 2) sum += nums[i]; return sum; } }