561. Array Partition I
来源:互联网 发布:中国大数据安全 编辑:程序博客网 时间:2024/06/04 19:00
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:
- 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].
public class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum=0;
for(int i=0;i<nums.length;i+=2)
sum+=nums[i];
return sum;
}
}
阅读全文
0 0
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- log4j1 如何平滑升级到log4j2呢
- 微信小程序,页面跳转
- JSP入门
- SpringBoot入门系列之目的确认、前置资料和目录导航
- AppCompatActivity和Activity的区别
- 561. Array Partition I
- iOS应用连接到App Store软件评分
- 时间复杂度和空间复杂度详解
- Httpurlconnetion post
- AdaBoost------Python实现二
- 专利查询
- Toast源码分析与学习
- cookie个人总结
- 暑假训练day2 : zoj选练