[LeetCode] 561. Array Partition I
来源:互联网 发布:爱淘宝流氓软件 编辑:程序博客网 时间:2024/06/13 21:27
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].
class Solution {public: int arrayPairSum(vector<int>& nums) { const int n = nums.size() / 2; sort(nums.begin(), nums.end()); int sum = 0; for (int i = 0; i < n; i++) sum += nums[2 * i]; return sum; }};
阅读全文
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
- 《Android源码设计模式解析与实战》读书笔记全集
- yii常用的一些操作调用
- 你不知道的JavaScript(三)闭包
- 04.21 三剑客之老大awk命令详解
- 基于window&&基于Linux的yum源安装
- [LeetCode] 561. Array Partition I
- Apache 2.4 + Tomcat7集群配置
- dmesg
- 在507干活的第3天(上)
- 1. Git安装与配置
- VC实现对话框客户区透明!
- 119. Pascal's Triangle II
- gitlab数据迁移后修改http链接
- selenium显示等待与隐士等待的区别