标签:which block inpu art ssi from class result ...
一、前言
二、题561 Array Partition I
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: 4 Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).Note:
- n is a positive integer, which is in the range of [1, 10000].
- All the integers in the array will be in the range of [-10000, 10000].
三、解题思路
1 class Solution { 2 public int arrayPairSum(int[] nums) { 3 Arrays.sort(nums); 4 int result = 0; 5 for (int i = 0; i < nums.length; i += 2) { 6 result += nums[i]; 7 } 8 return result; 9 } 10 }
Leetcode刷题记录[python]——561 Array Partition I
标签:which block inpu art ssi from class result ...
原文地址:http://www.cnblogs.com/Myoungs/p/7832870.html