[leetcode]561. Array Partition I
来源:互联网 发布:果园拆分系统源码 编辑:程序博客网 时间:2024/06/05 00:37
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.
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].
分析:
2n个数字分成n组,每组2个数字,取每组中较小的数字,求和。要求是得到的和最大,方法返回值即为这个最大和。
设2n个数字升序排序后为:a0,a1,a2,a3,….,a(2n-1)。
猜想一下容易发现,最大和即为 (a0+a2+a4+….+a(2n-2))
/** * @author binkang * @date May 6, 2017 */public class ArrayPartition1 {public int arrayPairSum(int[] nums) {Arrays.sort(nums);int sum = 0;for(int i=0;i<nums.length; i = i+2) {sum += getMin(nums[i], nums[i+1]);}return sum;}public int getMin(int a, int b) {return a < b ? a : b;}}
1 0
- LeetCode 561. Array Partition I
- LeetCode 561. Array Partition I
- [LeetCode]561. Array Partition I
- leetcode 561. Array Partition I
- LeetCode 561. Array Partition I
- Leetcode 561. Array Partition I
- [leetcode]561. Array Partition I
- LeetCode 561. Array Partition I
- LeetCode: 561. Array Partition I
- LeetCode 561. Array Partition I
- LeetCode: 561. Array Partition I
- LeetCode 561. Array Partition I
- LeetCode ** 561. Array Partition I
- leetcode.561.Array Partition I
- 【leetcode】561. Array Partition I
- [LeetCode]561.Array Partition I
- [leetcode]561. Array Partition I
- Leetcode 561.Array Partition I
- [TensorFlow]入门学习笔记(3)-图像预处理
- 二维码在线生成
- NOJ_1005
- Graphviz中文处理
- transform
- [leetcode]561. Array Partition I
- 基于glist自定义自己的链表数据结构
- 几种设计模式
- dao层开发代码
- SELECT LAST_INSERT_ID() 的使用和注意事项
- hdoj 5878 I Count Two Three
- python爬虫(五)多页码
- android 实现aidl跨进程通信之一
- Mac安装TensorFlow