摘要: def ftd(n, d): intPart=n/d remain=(n%d)*10 decPart=[ ] dix={ } i=0 while True: dec=remain/d ... 阅读全文
posted @ 2015-08-21 22:13 曾可爱 阅读(108) 评论(0) 推荐(0) 编辑
摘要: class Solution: # @param {integer} n # @return {integer} def numTrees(self, n): nums=[0]*(n+1) nums[0]=1 for i in range(1, n+1): for j in range(1, i+... 阅读全文
posted @ 2015-08-21 14:48 曾可爱 阅读(145) 评论(0) 推荐(0) 编辑