python--leetcode561. Array Partition I
来源:互联网 发布:名扬三角洲淘宝店铺 编辑:程序博客网 时间:2024/06/07 17:46
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个数字,按照(a1,b1)的方式组成n个序列,然后把所有min(ai,bi)加起来得合sum,求sum的最大值。
上代码:
class Solution(object): def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() sum=0 for i in range(len(nums)): if(i%2==0): sum=sum+nums[i] return sum思路很简单,给list排个序,所有下标为偶数的元素加起来就为所求。
设想给定情况为[1,2,4,3]四个元素,组合成[1,2]、[3,4]这样所求sum值最大。
当然还有更简单的一行代码:
class Solution(object): def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ return sum(sorted(nums)[::2])
阅读全文
1 0
- python--leetcode561. Array Partition I
- leetcode561. Array Partition I
- leetcode561. Array Partition I
- leetcode561: Array Partition I
- LeetCode561. Array Partition I
- Leetcode561. Array Partition I
- 7.leetCode561.:Array Partition I
- [leetcode: Python]561. Array Partition I
- 【Leetcode】【python】Array Partition I, Number Complement
- Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- Array Partition I
- 561. Array Partition I
- 561. Array Partition I
- Spring Aop的一个简单列子 (确实浅显易懂好文章!)
- angular页面在ios上title标题无法显示问题
- hadoop2.7.3版本FileSystem调用过程(1)
- Java数据结构详解(三)-ArrayList
- BZOJ 1217: [HNOI2003]消防局的设立
- python--leetcode561. Array Partition I
- iOS11: 使用Xcode9后的11条小建议 韩俊强的博客
- 同一台电脑上安装python3.5和python2.7及安装时一些工具包的方法
- openpose(1) 在qtcreator中运行
- Synchronized、lock、volatile、ThreadLocal、原子性总结、Condition
- ICON 居中問題
- Unity截屏方法
- jmeter源码---HashTree
- redis 3.2 cluster搭建