edit 172

fishercoder1534 · fishercoder1534 · commit de223cbbf822 · 2017-07-25T11:57:04.000-07:00
diff --git a/README.md b/README.md
@@ -398,7 +398,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |179|[Largest Number](https://leetcode.com/problems/largest-number/)|[Queue](../master/src/main/java/com/fishercoder/solutions/BSTIterator_using_q.java) [Stack](../../blmaster/MEDIUM/src/medium/LargestNumber.java)| O(?) |O(?) | Medium|
 |174|[Dungeon Game](https://leetcode.com/problems/dungeon-game/)|[Queue](../master/src/main/java/com/fishercoder/solutions/BSTIterator_using_q.java) [Stack](../../blmaster/MEDIUM/src/medium/_174.java)| O(m*n) |O(m*n) | Hard| DP
 |173|[Binary Search Tree Iterator](https://leetcode.com/problems/binary-search-tree-iterator/)|[Queue](../master/src/main/java/com/fishercoder/solutions/_173_using_q.java) [Stack](../../blmaster/MEDIUM/src/medium/_173_using_stack.java)| O(1) |O(h) | Medium| Stack, Design
-|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FactorialTrailingZeroes.java)| O(logn)|O(1)| Easy
+|172|[Factorial Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_172.java)| O(logn)|O(1)| Easy
 |171|[Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_171.java)| O(n)|O(1)| Easy
 |170|[Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_170.java)| O(n)|O(n)| Easy
 |169|[Majority Element](https://leetcode.com/problems/majority-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MajorityElement.java)| O(n)|O(1) | Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_172.java b/src/main/java/com/fishercoder/solutions/_172.java
@@ -2,7 +2,7 @@
 /**Given an integer n, return the number of trailing zeroes in n!.
 
  Note: Your solution should be in logarithmic time complexity.*/
-public class FactorialTrailingZeroes {
+public class _172 {
 
     public int trailingZeroes(int n) {
         int result = 0;
