数据结构与算法
双指针、回溯剪枝、图论与搜索
🎨 视觉封面LeetCode Factorial Trailing Zeroes
Problem
Given an integer n, return the number of trailing zeroes in n!.
Note: Your solution should be in logarithmic time complexity.
即计算n!末尾0的个数。要求用对数时间复杂度
Python 实现
# Given an integer n, return the number of trailing zeroes in n!.
#
# Note: Your solution should be in logarithmic time complexity.
# author li.hzh
class Solution:
def trailingZeroes(self, n):
"""
:type n: int
:rtype: int
"""
result = 0
while n >= 5:
result += n // 5
n = n // 5
return result
solution = Solution()
print(solution.trailingZeroes(102))
分析
思路其实很直接,因为想出现0。就是 2 * 5(的倍数)。注意25是两个5。2足够。因此题目就变成求1 到 n。有多少个5。
然后,就是这个计算多少个5,却让我想了一段时间,确实不应该。就是就是递归的/5即可。因为第一次/5相等于计算有多少个5。再加上第二次,相当于求多少个25。第三次就是多少个125。叠加到一次,正好就是所有的5的个数。
所有代码开源上传至 GitHub:yummy-code 仓库 · GESP 专题站:GESP WIKI
欢迎加入:C++ GESP/CSP 考级答疑群(688906745) 与 Java/Python交流群(982860385),点击可直接加群。
猜你想读 · 相关文章推荐
LeetCode Minimum Depth of Binary Tree
Problem Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest lea...
LeetCode Path Sum
Problem Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For...
LeetCode Path Sum II
Problem Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum...
OneCoder (lihongzheshuai)
一个中年人的自留地,记录学习 C++、GESP/NOI、Java、Python 与算法架构的心得体会。本站唯一网址:coderli.com