[Leetcode] 561. Array Partition I 解题报告
来源:互联网 发布:怎么申请淘宝旗舰店 编辑:程序博客网 时间:2024/06/10 20:34
题目:
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].
思路:
练手题目,哈哈。首先对nums排序,然后将其奇数索引下的数加起来即可。
代码:
class Solution {public: int arrayPairSum(vector<int>& nums) { sort(nums.begin(), nums.end()); int ret = 0; for (int i = 0; i < nums.size(); i +=2) { ret += nums[i]; } return ret; }};
阅读全文
0 0
- 【LeetCode】561.Array Partition I解题报告
- [Leetcode] 561. Array Partition I 解题报告
- 【LeetCode】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
- 雇员管理系统-SSH版(八)
- Longest Substring Without Repeating Characters
- centos配置hostname
- 解决linux下sudo更改文件权限报错xxxis not in the sudoers file. This incident will be reported.
- 蓝桥杯 算法训练 区间k大数查询
- [Leetcode] 561. Array Partition I 解题报告
- rhinoceros Mac(犀牛mac) v5.4中文破解版
- 闭包与匿名函数
- 关于操作系统
- POJ
- 雇员管理系统-SSH版(十)
- C++ 指针
- xshell评估过期解决办法
- 常用算法与数据结构插图