LeetCode-561 Array Partition I Solution (with Java)

1. Description:

Notes:

2. Examples:

3.Solutions:

/**
 * Created by sheepcore on 2019-02-24
 */
class Solution {
    public int arrayPairSum(int[] nums) {
        Arrays.sort(nums);
        int res = 0;
        for (int i = 0; i < nums.length; i += 2) {
            res += nums[i];
        }
        return res;
    }
}