LeetCode 561 : ArrayPartition I
来源:互联网 发布:oppo手机怎么优化网络 编辑:程序博客网 时间:2024/06/01 08:31
LeetCode 561 : ArrayPartition I
题目大意
将一个长度为2n的数组分成n对,获取每对中的最小值,使最小值的和最大。
- Description
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. 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].
- Example
Input: [1,4,3,2]Output: 4Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
思路分析
将数组从小到大排序,将偶数位的值相加即可。贪心算法,每次都获得当前可获得的最大的最小值,即仅比最大值小的值,然后去除当前最大值,继续比较。
相应代码
int arrayPairSum(vector<int>& nums) { int sum = 0; int n = nums.size(); sort(nums.begin(), nums.end()); for(int i=0;i<n-1;i+=2){ sum +=nums[i]; } return sum; }
阅读全文
0 0
- LeetCode 561 : ArrayPartition I
- leetcode 561---- ArrayPartition
- LeetCode之ArrayPartition
- 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
- c语言课程设计-学生成绩管理系统
- SSH协议原理
- Codeforces Gym F. Performance Review (树状数组 + DFS 序)
- 回文串题目总结
- java 获取客户端用户真实ip
- LeetCode 561 : ArrayPartition I
- 将汉字转为字符串
- 【Swift】数据的存放
- nodeJs随笔
- 检查链表是否为回文
- 秒杀系统优化思路
- Delphi预编译指令总结
- 掌握变量的分类
- python一道关于文件操作的题