Factorial Trailing Zeroes

Change-Id: I876626a1bc512ea53fd09c274f22d010cdc73371

Author: applewjg

FactorialTrailingZeroes.java

@@ -0,0 +1,23 @@
+/*
+ Author:     King, [email protected]
+ Date:       Dec 13, 2014
+ Problem:    Factorial Trailing Zeroes
+ Difficulty: Easy
+ Source:     https://oj.leetcode.com/problems/factorial-trailing-zeroes/
+ Notes:
+ Given an integer n, return the number of trailing zeroes in n!.
+
+ Note: Your solution should be in logarithmic time complexity.
+
+ Solution: ...
+ */
+public class Solution {
+    public int trailingZeroes(int n) {
+        int res = 0;
+        while (n != 0) {
+            res += n / 5;
+            n = n / 5;
+        }
+        return res;
+    }
+}