refactor 231

fishercoder1534 · fishercoder1534 · commit cdce4bcafeb4 · 2018-10-07T08:09:43.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_231.java b/src/main/java/com/fishercoder/solutions/_231.java
@@ -1,19 +1,18 @@
 package com.fishercoder.solutions;
 
-/**231. Power of Two
+/**
+ * 231. Power of Two
  *
- * Given an integer, write a function to determine if it is a power of two.*/
+ * Given an integer, write a function to determine if it is a power of two.
+ */
 
 public class _231 {
-    public boolean isPowerOfTwo(int n) {
-        //after writing out the binary representation of some numbers: 1,2,4,8,16,32, you can easily figure out that
-        //every number that is power of two has only one bit that is 1
-        //then we can apply that cool trick that we learned from {@link easy._191}: n&(n-1) which will clear the least significant bit in n to zero
-        return n > 0 && (n & (n - 1)) == 0;
-    }
-
-    public static void main(String... strings) {
-        _231 test = new _231();
-        System.out.println(test.isPowerOfTwo(14));
+    public static class Solution1 {
+        public boolean isPowerOfTwo(int n) {
+            //after writing out the binary representation of some numbers: 1,2,4,8,16,32, you can easily figure out that
+            //every number that is power of two has only one bit that is 1
+            //then we can apply that cool trick that we learned from {@link easy._191}: n&(n-1) which will clear the least significant bit in n to zero
+            return n > 0 && (n & (n - 1)) == 0;
+        }
     }
 }
