LeetCode 561 Array Partition I
来源：互联网 发布：繁体字转换简体字 mac 编辑：程序博客网 时间：2024/05/17 05:10
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].
题目分析：显然从小到大排序后，相邻的两个为一组最优
public class Solution { public int arrayPairSum(int[] nums) { Arrays.sort(nums); int sum = 0; for (int i = 0; i < nums.length; i += 2) { sum += nums[i]; } return sum; }}阅读全文
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]
- Python标准库--random，sys，time
- jdk 中常用的 xml 数据解析
- OPP文件传输
- 关于C中的\n
- 剑指offer | 训练题52：表示数值的字符串
- LeetCode 561 Array Partition I
- Redis-数据库管理
- 方法（二）
- 孪生数（因数之和）
- Android Studio在导入moudle后出现layout布局文件无法显示
- 股票涨跌预测方法之一：下载股票数据
- test
- Windows access Linux
- 操作系统安全防范措施
