Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

public class Solution { public int trailingZeroes(int n) { //count the number of 5 int result = 0; while(n/5>=1){ n = n/5; result += n; } return result; } }

The complexity is O(LogN)*[O(1)+O(1)] Since your loop condition n/5>=1 implies the loop is going to execute Log(5) n times, which is O(LogN)

Greatly appreciate!

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.