一边看算法,一边刷题吧,先从简单的开始:
刷题之路这就开始了?
561. Array Partition I
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).
思路:
就是先排序,每隔一个加到sum中去
class Solution(object):
def arrayPairSum(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
sum=0
nums=sorted(nums)
j=0
n=int(len(nums)/2)
for i in range(n):
sum+=nums[j]
j+=2
return sum
注意:
需要注意sort()函数没有返回值!没有返回值!没有返回值!sorted()函数就很厉害了~~
766. Toeplitz Matrix
A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.