leetcode 561---- ArrayPartition
来源:互联网 发布:监控摄像头客户端软件 编辑:程序博客网 时间:2024/06/05 16:23
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].
题意 ,给你一个2n长度数组,分成n个长度为2的数组,使得这n个数组的最小值总和最小
简答题目, 把所有的数存入一个排序数组中,每2个数取一个最小值就可以了
int arrayPairSum(int* nums,int numsSize) { int i = 0,n=numsSize; int sum = 0; int store[20001]; int flag = 0; for(i=0;i<20001;i++){ store[i]=0; } for(i=0;i<n;i++){ store[nums[i]+10000]++; } for(i=0;i<20001;i++){ if(store[i]>0){ if(flag == 0){ sum+= (i-10000); store[i]--; flag = 1; if(store[i]>0){ i--; } }else{ if(store[i]>0){ store[i]--; } if(store[i]>0){ i--; } flag = 0; } }else{ continue; } } return sum;}
阅读全文
0 0
- LeetCode 561 : ArrayPartition I
- leetcode 561---- ArrayPartition
- LeetCode之ArrayPartition
- leetcode 561
- leetcode
- [leetcode]
- LeetCode
- leetcode
- leetcode
- leetcode:
- leetcode:
- LeetCode
- leetcode
- LEETCODE
- leetcode
- leetCode
- leetcode
- [leetcode]
- 运行 python manage.py build_solr_schema 出现TypeError
- Linux下搭建Web项目运行环境Tomcat+Mysql+Jdk
- XML讲解
- spring中事务配置REQUIRES_NEW不起作用
- checkbox多选显示同级下一个元素的值
- leetcode 561---- ArrayPartition
- BZOJ 2654: tree kruskal 二分
- 华为手机设置状态栏透明 竟出现灰色的背景问题
- MYSQL 操作中文乱码问题
- String中intern的方法
- 利用poi从jsp页面导出报表到excel
- 使用ffmpeg从视频中截取图像帧
- jmeter常见问题汇总
- ArcEngine真正释放锁文件,彻底移除图层