LeetCode 561. Array Partition I
2017-07-14 00:34
375 查看
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 = 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].
Example 1:
Input: [1,4,3,2]
Output: 4
Explanation: 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) { sort(nums.begin(),nums.end()); int sum=0; for(int i=0;i<nums.size();i+=2){ sum+=nums[i]; } return sum; } };
相关文章推荐
- 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
- Leetcode561. 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
- python--leetcode561. Array Partition I
- leetcode561. Array Partition I
- [LeetCode] 561.Array Partition I
- Leetcode题解-561. Array Partition I
- 【跟Leon一起刷LeetCode】561. Array Partition I
- [LeetCode]561.Array Partition I
- leetcode题解-561. Array Partition I && 62. Unique Paths && 63. Unique Paths II
- [Leetcode从零开刷]561. Array Partition I