leetcode试水--561. Array Partition I
2017-09-21 20:49
567 查看
看了几天python来练手,第一次用leetcode不太会,于是找了最水的题,结果还真不会用
可能刷几个题之后会好一点吧?
题目:https://leetcode.com/problems/array-partition-i/description/
排序,其实反证法可能更容易理解一点,后面只要证明任意非升序序列不满足要求就好
可能刷几个题之后会好一点吧?
题目:https://leetcode.com/problems/array-partition-i/description/
排序,其实反证法可能更容易理解一点,后面只要证明任意非升序序列不满足要求就好
class Solution(object): def arrayPairSum(self, nums): """ :type nums: List[int] :rtype: int """ nums.sort() i = 0 res = 0 while i < len(nums): res += nums[i] i += 2 return res
相关文章推荐
- 【LeetCode】561. Array Partition I
- LeetCode 561. Array Partition I
- leetcode:561. Array Partition I
- leetcode561. Array Partition I
- LeetCode 561. Array Partition I
- python--leetcode561. Array Partition I
- Leetcode561. 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 && 62. Unique Paths && 63. Unique Paths II
- 【跟Leon一起刷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