LeetCode 561. Array Partition I
来源:互联网 发布:汽车零部件进出口数据 编辑:程序博客网 时间:2024/06/03 19:39
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.
Example 1:
Input:
[1,4,3,2]
Output:4
Explanation:n is 2, and the maximum sum of pairs is 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].
Solution
题意要求分割数组,两两一对,使得每对中较小的数的和最大。使用贪婪算法,要最大化每对中的较小值之和,那么每对中两个数字大小越接近越好,因为如果差距过大,而只取较小的数字,那么大数字就浪费了。所以只需给数组排序,然后按顺序的每两个就是一对,取出每对中的第一个数即为较小值,累加起来即可。
class Solution {public: int arrayPairSum(vector<int>& nums) { int res = 0, n = nums.size(); sort(nums.begin(), nums.end()); for (int i = 0; i < n; i += 2) { res += nums[i]; } return res; }};
阅读全文
0 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
- [Leetcode] 158. Read N Characters Given Read4 II
- C++数组指针
- android 通知栏的Intent事件
- 用友U8获取指定用户在某个账套中是否拥有指定权限
- java做网站
- LeetCode 561. Array Partition I
- 【数组模拟链表】UVA
- Spring线程池和自定义线程池的使用
- 06-图1 列出连通集 (25分) C++
- 2017.5.27入门组总结
- 【剑指offer-解题系列(32)】整数区间中出现1的个数
- 第6课
- freemarker的应用
- Http协议详解