- 博客(2)
- 收藏
- 关注
RSS订阅原创 Fibonacci
斐波那契数列一定不能递归，肯定会超时，要用递推写 class Solution: # @param n: an integer # @return an integer f(n) def fibonacci(self, n): # write your code here a = [0, 1] if n < 3:
2015-08-02 01:00:19
209
1
原创 Leetcode Pascal's Triangle
# Pascal's Triangle # https://leetcode.com/problems/pascals-triangle/ """Given numRows, generate the first numRows of Pascal's triangle. For example, given numRows = 5, Return [
2015-07-24 10:11:50
173
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人