- 博客(3)
- 问答 (1)
- 收藏
- 关注
原创 [Leetcode] 47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1
2017-09-29 20:57:16 278
转载 [Leetcode] 576. Out of Boundary Paths
原方法参见博文:http://www.cnblogs.com/grandyang/p/6927921.htmlhere is an m by n grid with a ball. Given the start coordinate (i,j) of the ball, you can move the ball to adjacent cell or cross the grid bo
2017-09-03 18:16:55 393
原创 [Leetcode] 646. Maximum Length of Pair Chain
You are given n pairs of numbers. In every pair, the first number is always smaller than the second number.Now, we define a pair (c, d) can follow another pair (a, b) if and only if b . Chain
2017-09-03 00:11:05 486
空空如也
在使用wxPython的FileDialog类打开一文件时 会卡顿,无响应,是怎么回事?
2017-04-08
TA创建的收藏夹 TA关注的收藏夹
TA关注的人