LeetCode172. Factorial Trailing Zeroes
摘要:
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution should be in logarithmic time complexity. 分析: 1.那么很容易想到需要统计(2,5)对的 阅读全文
posted @ 2016-03-26 20:25 时间的女儿 阅读(174) 评论(0) 推荐(0) 编辑