LeetCode 561. Array Partition I

题目：
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:
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].

思路：
就是给2n个数分组，两两一组，使用所有组中小的那个数加起来和最小。
那么就是先将所有数排序，然后就是以排序后的值2个一组分组，然后取的就是两个中前一个的索引对应的值。

代码：

class Solution {
public:int arrayPairSum(vector<int>& nums) {vector<int>::size_type nsize=nums.size();//计算数组大小if(nsize==0){//如果大小为0，直接返回0return 0;}sort(nums.begin(),nums.end());//排序int sum=0;for(int i=0;i<nsize;i+=2){//计算两两一组中，数小的那个，和即为结果sum+=nums[i];}return sum;}
};

输出结果： 106ms

LeetCode 561. Array Partition I相关推荐

[LeetCode]561. Array Partition I (数组分区 1)
561. Array Partition I Given an array of 2n integers, your task is to group these integers into n pa ...
LeetCode 561 Array Partition I（数组划分）
翻译原文 Given an array of 2n integers, your task is to group these integers into n pairs of integer, s ...
leetcode#561 Array Partition I
Description: Given an array of 2n integers, your task is to group these integers into n pairs of int ...
Leetcode PHP题解--D14 561. Array Partition I
561. Array Partition I 题目链接 561. Array Partition I 题目分析本题给了一个数组,要求将数组分为n个只有2个元素的一对. 使得每对数字中最小的数加起来的 ...
Leetcode刷题记录[java]——561 Array Partition I
一.前言二.题561 Array Partition I Given an array of 2n integers, your task is to group these integers in ...
561.Array Partition I--Python
刚开始学习Python编程,欢迎交流学习! 561.Array Partition I Given an array of 2n integers, your task is to group the ...
【刷leetcode，拿Offer-009】561. Array Partition I（贪心，C++）
题目链接 Given an array of 2n integers, your task is to group these integers into n pairs of integer, sa ...
561. Array Partition I
原题 Given an array of 2n integers, your task is to group these integers into n pairs of integer, say ...
561. 数组拆分 I（javascript）561. Array Partition I
给定长度为 2n 的整数数组 nums ,你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), -, (an, bn) ,使得从 1 到 n 的 min(ai, bi) 总和 ...

LeetCode 561. Array Partition I

LeetCode 561. Array Partition I相关推荐

最新文章

热门文章