算法-array-6-ReshapetheMatrix

package leet.array;import java.util.Arrays;public class ArrayPartition1 {/*题目要求：Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible. Example 1:Input: [1,4,3,2]Output: 4Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).Note:1.n is a positive integer, which is in the range of [1, 10000].2.All the integers in the array will be in the range of [-10000, 10000].【思路】1.先排序2.因为是两两一组，那么统计奇数下标就可以了。*/    public int arrayPartition(int[] nums){        int result = 0;        Arrays.sort(nums);        for (int i = 0; i < nums.length; i+=2) {            result += nums[i];        }        return result;    }    public static void main(String[] args){        ArrayPartition1 arrayPartition1 = new ArrayPartition1();        int[] nums = {1,3,4,20};        System.out.println(arrayPartition1.arrayPartition(nums));    }}