
python,LeetCode
hot-horse
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
leetcode array数组刷题easy组: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 t原创 2017-08-27 09:53:50 · 333 阅读 · 0 评论 -
leetcode 数组array之566. Reshape the Matrix
方法一: class Solution(object): def matrixReshape(self, nums, r, c): """ :type nums: List[List[int]] :type r: int :type c: int :rtype: List[List[int]]原创 2017-08-29 11:57:11 · 360 阅读 · 0 评论