561. Array Partition I
来源:互联网 发布:tcp 发送syslog java 编辑:程序博客网 时间:2024/05/29 19:47
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(object): def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() list = nums[::2] s = 0 for i in list: s+=i return s
阅读全文
0 0
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- HBase安装
- Android开发实践:Java层与Jni层的数组传递
- linux下基本命令
- Head first JavaScript_#1简单用户交互界面
- NYOJ 17-单调递增最长子序列(典型DP)
- 561. Array Partition I
- WebStorm下使用Github上传项目代码
- 38条PHP优化代码!让你的程序更简洁!
- python 时间操作
- iOS 最简单解决事件冲突的思路,深入浅出cancelsTouchesInView属性
- OrientDB社区版Linux分布式部署失败
- 使聊天机器人具有个性
- 强化学习及Python代码示例
- HTML-标签语义化