Write an algorithm which computes the number of trailing zeros in n factorial.
11! = 39916800, so the out should be 2
public class Solution {/* * @param n: An integer * @return: An integer, denote the number of trailing zeros in n! */public static long trailingZeros(long n) {// write your code here, try to do it without arithmetic operators.long s = 0;for(long i=5;n/i>=1;i*=5){s += n/i;}return s;}}
Topic Math Description [https://leetcode.com/problems/factorial-trailing-zeroe
Problem: > Given an integer n, return the number of trailing zeroes in n!. > > Note: Y
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution sho
题目： Given an integer n, return the number of trailing zeroes in n!. Note: Your soluti
原题 [原题链接][Link 1] > Given an integer n, return the number of trailing zeroes in n!.
1.题目 Given an integer n, return the number of trailing zeroes in n!. Note: Your sol
题目大意 给定一个整数n，返回n!（n的阶乘）数字中的后缀0的个数。 注意：你的解法应该满足多项式时间复杂度。 解题思路 思路参考：[书影博客][Link 1
Given an integer n, return the number of trailing zeroes in n!. Note: Your solution sho
2. Trailing Zeros Description Write an algorithm which computes the number of
You task is to find minimal natural number N, so that N! contains exactly Q zeroes on th
今天药忘吃喽~
清疚
你的名字
淩亂°似流年
超、凢脫俗
深藏阁楼爱情的钟
灰太狼
还没有评论，来说两句吧...