leetcode:561. 数组拆分 I

class Solution {
    public int arrayPairSum(int[] nums) {
	      /*
	      1 4 3 5 9 2
	      1 2 3 4 5 9
	      12
	      34
	      59
	      */
	        if(nums.length==2){
	            return Math.min(nums[0], nums[1]);
	        }
	        int sum=0;
	        Arrays.sort(nums);
	        for(int i=0;i<nums.length;i+=2) {
	        	sum+=nums[i];
	        }
			return sum;
	        
	    }
}