leetcode 561:Array Partition I
来源:互联网 发布:ie淘宝网无法登录 编辑:程序博客网 时间:2024/06/07 04:45
原题:
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].
代码如下:
int arrayPairSum(int* nums, int numsSize) { int comp(const void* a,const void* b) { return *(int*)a-*(int*)b; } qsort(nums,numsSize,sizeof(int),comp); int result=0; for(int n=0;n<numsSize;n+=2) { result+=*(nums+n); } return result;}
排序以后跳着加。
时间就是O(n)。
阅读全文
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
- Array Partition I[LeetCode 561]
- Android主进程判断
- 判断物体是否在视野范围内
- 计算音频帧的播放时间(音频码流 音频帧)
- [bzoj2957]楼房重建 线段树
- 读取二代身份证号,做个记录
- leetcode 561:Array Partition I
- solr 6.6.0开始
- Python爬虫入门二之爬虫基础了解
- 音频帧概念详解
- <input type="number" /> 限制长度
- JS异步之:回调/Promise/协程/Generator
- VMWare虚拟机NAT模式下static IP(适用有mac vmvare fusion)
- Reverse Integer
- robotframework-ride取消默认加载的工程