Roughly commit

Author: fibers

src/main/java/com/fibers/algorithm/leetcode/_172/Solution.java

@@ -1,4 +1,8 @@
 package com.fibers.algorithm.leetcode._172;
+
 public class Solution {
+    public int trailingZeroes(int n) {
+        return n <= 0 ? 0 : n / 5 + trailingZeroes(n / 5);
+    }
 }
-
+

src/main/java/com/fibers/algorithm/leetcode/_231/Solution.java

@@ -1,4 +1,8 @@
 package com.fibers.algorithm.leetcode._231;
+
 public class Solution {
+    public boolean isPowerOfTwo(int n) {
+        return (n > 0) && (n & (n - 1)) == 0;
+    }
 }
-
+

src/main/java/com/fibers/algorithm/leetcode/_326/Solution.java

@@ -1,4 +1,8 @@
 package com.fibers.algorithm.leetcode._326;
+
 public class Solution {
+    public boolean isPowerOfThree(int n) {
+        return n > 0 && (1162261467 % n == 0);
+    }
 }
-
+