2016年12月19日

LintCode 366 Fibonacci

摘要： /* 1st method will lead to time limit *//* the time complexity is exponential sicne T(n) = T(n-1) + T(n-2) */ /* 2nd method will need O(n) space, usin 阅读全文
posted @ 2016-12-19 01:04 wenchan 阅读(375) 评论(0) 推荐(0)