FactorialTrailingZeroes

applewjg · applewjg · commit 514b71dcb423 · 2014-12-30T12:03:14.000+08:00
Change-Id: Ib2890824124c904ffd7cc12048c2a1a359460826
diff --git a/FactorialTrailingZeroes.cpp b/FactorialTrailingZeroes.cpp
@@ -0,0 +1,25 @@
+/*
+ Author:     King, wangjingui@outlook.com
+ 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: ...
+ */
+
+class Solution {
+public:
+    int trailingZeroes(int n) {
+        int res = 0;
+        while (n) {
+            res += n / 5;
+            n /= 5;
+        }
+        return res;
+    }
+};
