561. Array Partition I【easy】
2024-09-04 16:39:58
561. Array Partition I【easy】
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].
解法一:
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
if (nums.empty()) {
return ;
} sort(nums.begin(), nums.end()); int sum = ;
for (int i = ; i < nums.size(); i += ) {
sum += nums[i];
} return sum;
}
};
为了不浪费元素,先排序,这样可以保证min加出来为max
比如[1, 9, 2, 4, 6, 8]
如果按顺序来的话,1和9就取1,2和4就取2,6和8就取6,显而易见并不是最大,原因就是9在和1比较的时候被浪费了,9一旦浪费就把8也给影响了,所以要先排序
@shawngao 引入了数学证明的方法,如下:
Let me try to prove the algorithm...
- Assume in each pair
i
,bi >= ai
. - Denote
Sm = min(a1, b1) + min(a2, b2) + ... + min(an, bn)
. The biggestSm
is the answer of this problem. Given1
,Sm = a1 + a2 + ... + an
. - Denote
Sa = a1 + b1 + a2 + b2 + ... + an + bn
.Sa
is constant for a given input. - Denote
di = |ai - bi|
. Given1
,di = bi - ai
. DenoteSd = d1 + d2 + ... + dn
. - So
Sa = a1 + a1 + d1 + a2 + a2 + d2 + ... + an + an + di = 2Sm + Sd
=>Sm = (Sa - Sd) / 2
. To get the maxSm
, givenSa
is constant, we need to makeSd
as small as possible. - So this problem becomes finding pairs in an array that makes sum of
di
(distance betweenai
andbi
) as small as possible. Apparently, sum of these distances of adjacent elements is the smallest. If that's not intuitive enough, see attached picture. Case 1 has the smallestSd
.
最新文章
- IE 浏览器各个版本 JavaScript 支持情况一览表
- javascript:window.history.go(-1)
- getaddrinfo
- js模拟表单提交
- (六)6.7 Neurons Networks whitening
- ANDROID_MARS学习笔记_S05_004_过滤杂质,得到真正的加速度
- sift算法c语言实现
- synchronized和进程间通信(转)
- WebService小记
- KMP算法 --- 在文本中寻找目标字符串
- 【VMware Workstation】虚拟机静态IP NAT连接外部网络(局域网以及广域网)
- 在Django中使用Neo4j
- Confluence 6 针对 &#39;unmigrated-wiki-markup&#39; 宏重新尝试合并
- STM32应用实例十四:利用光敏二极管实现光度测量
- jQuery中empty与html(";";)的区别对比
- hdu5646数学构造+二分
- jQuery应用一之验证插件validate的使用
- PREV-5_蓝桥杯_错误票据
- TextView 设置部分文字颜色及点击事件SpannableString
- 解决Oracle11g空表无法导出的问题
热门文章
- [Codeforces 10E] Greedy Change
- 【可持久化Trie】bzoj3261 最大异或和
- 【费马小定理+矩阵快速幂】HDU4549——M斐波那契数列
- 微服务之SpringCloud实战(五):SpringCloud Eureka详解
- 将SeqReader打包成可执行的jar包
- Mac SublimeREPL 插件安装使用及解决各种坑
- Delphi Thread
- go/golang init()方法的调用
- 写一个函数判断字符串中";{";与";}";,";[";与";]";,";(";与";)";匹配,";{";必须在";}";前面,";[";必须在";]";前面,";(";必须在";)";前面,可以嵌套
- Bat 获取本地代码的Svn Revision并保存到变量