edit 326

Author: fishercoder1534

README.md

@@ -266,6 +266,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestIncreasingPathInAMatrix.java)| O(?)|O(?) | Hard|
 |328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_328.java)| O(n)|O(1) | Medium| Linked List
 |327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_327.java)| O(?)|O(?) | Hard|
+|326|[Power of Three](https://leetcode.com/problems/power-of-three/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_326.java)| O(1)|O(1) | Easy| Math
 |325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)|[Solution] | O(n)|O(n) | Medium| HashMap
 |324|[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_324.java)| O(n)|O(n) | Medium| Sort
 |323|[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NumberOfConnectedComponentsInAnUndirectedGraph.java)| O(?)|O(?)| Medium|

src/main/java/com/fishercoder/solutions/PowerOfThree.java renamed to src/main/java/com/fishercoder/solutions/_326.java

@@ -1,16 +1,14 @@
 package com.fishercoder.solutions;
-/**326. Power of Three  QuestionEditorial Solution  My Submissions
-Total Accepted: 57555
-Total Submissions: 151383
-Difficulty: Easy
+
+/**326. Power of Three
+ *
 Given an integer, write a function to determine if it is a power of three.
 
 Follow up:
 Could you do it without using any loop / recursion?
-
 */
 
-public class PowerOfThree {
+public class _326 {
     //then I turned to the Editorial solution, it's pretty elegant to use base conversion which can be easily extended to any radix k
     //Idea: for a number in base 10, if it's power of 10, then it must be in this format: 10, 100, 1000... with a leading one and all trailing zeros
     //similarly, if a number is power of 3, then in its base 3 format, it must be in this format as well: 10, 100, 1000, 1000...
@@ -35,7 +33,7 @@ public boolean isPowerOfThree(int n) {
     }
 
     public static void main(String...strings){
-        PowerOfThree test = new PowerOfThree();
+        _326 test = new _326();
         System.out.println(test.isPowerOfThree(12));
 
         //find the max integer that is power of 3