lintcode/leetcode由易至难第4题:Array Partition I
来源:互联网 发布:吉利知豆d1导航系统 编辑:程序博客网 时间:2024/06/06 02:18
题目:
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.
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].
code:
public class Solution { public int arrayPairSum(int[] nums) { Arrays.sort(nums); //新接触的function int result = 0; for(int i = 0; i < nums.length; i = i+2){ result = nums[i] + result; } return result; }}
阅读全文
0 0
- lintcode/leetcode由易至难第4题:Array Partition I
- LeetCode Array Partition I
- leetCode---Array Partition I
- Array Partition I(leetcode)
- Leetcode-Array Partition I
- leetcode 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
- Kotlin之类和对象
- JNI中java类型与C/C++类型对应关系及接口写法
- ZooKeeper系列(三)
- 使用thinkphp微信token验证失败
- Spark性能调优(五)
- lintcode/leetcode由易至难第4题:Array Partition I
- Leetcode 400(Java)
- 堆 续6
- compiling IB documents for earlier than ios 7 is no longer supported
- ONVIF双向对讲(RTSP协议)
- Servlet3 ServletContainerInitializer与Spring Web
- Android开发(二)
- 从HGraph生成SSA
- 操作系统(进程2)