LeetCode 561. Array Partition I
来源:互联网 发布:北大青鸟编程v5 编辑:程序博客网 时间:2024/06/06 19:30
问题描述
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].
问题分析
给定一个长度为2n的数组,将这个数组分为n个(ai,bi),其中ai
sum(ai) + sum(bi) = sun(all)==> sum(ai)+sum(bi-ai)+sum(ai)= sum(all)==> 2sum(ai)+sum(bi-ai) = sum(all)==>sum(all)是常数,求sum(ai)最大,变为求sum(bi-ai)的和最小。==> 相邻大小的两个值的差值的和最小。
代码实现
public int arrayPairSum(int[] nums) { if (nums == null || nums.length == 0) { return 0; } 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
- Leetcode 561.Array Partition I
- 学生管理系统——数据库表设计
- 3GPP TS 36.331 ASN.1消息中Optional的含义
- 安卓调试/测试-AS(android studio)——工具篇之Android Monitors
- Python--selenium-webdriver输入框定位
- jdk1.8之前版本------->HashMap简述
- LeetCode 561. Array Partition I
- 七.SpringBoot集成实例系列-多数据源mongodb(一)
- 数据结构笔记之线性表
- java, double转String, 去掉0结尾的小数位
- 浅谈数据库中的触发器
- CAS单点登录-单点登出/退出/注销(十二)
- ARM+FPGA如何入门,如何学习入门嵌入式
- 细说Angular ng-class
- 学生管理系统——xsgl.util