edit 342

fishercoder1534 · fishercoder1534 · commit a4d5c3e7e061 · 2017-07-24T18:54:16.000-07:00
diff --git a/README.md b/README.md
@@ -249,6 +249,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |345|[Reverse Vowels of a String](https://leetcode.com/problems/reverse-vowels-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_345.java) | O(n) |O(1) | Easy | String
 |344|[Reverse String](https://leetcode.com/problems/reverse-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_344.java) | O(n) |O(1) | Easy | String
 |343|[Integer Break](https://leetcode.com/problems/integer-break/)|[Solution](../master/src/main/java/com/fishercoder/solutions/IntegerBreak.java)| O(1)|O(1) | Medium| Math
+|342|[Power of Four](https://leetcode.com/problems/power-of-four/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_342.java)| O(n)|O(1) | Easy| Math
 |341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_341.java)| O(n)|O(n) | Medium| Stack
 |340|[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_340.java)| O(n)|O(1) | Hard| Sliding Window
 |339|[Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_339.java)| O(n)|O(h)) | Easy| DFS
diff --git a/src/main/java/com/fishercoder/solutions/_342.java b/src/main/java/com/fishercoder/solutions/_342.java
@@ -1,15 +1,12 @@
 package com.fishercoder.solutions;
-/**342. Power of Four  QuestionEditorial Solution  My Submissions
-Total Accepted: 31004
-Total Submissions: 86897
-Difficulty: Easy
+/**342. Power of Four
 Given an integer (signed 32 bits), write a function to check whether it is a power of 4.
 
 Example:
 Given num = 16, return true. Given num = 5, return false.
 
 Follow up: Could you solve it without loops/recursion?*/
-public class PowerOfFour {
+public class _342 {
     //with my original idea in the bottom, just dive a little bit deeper, you can realize that another important feature of a number
     //that is power of four is that its only single one bit must appear on the odd position, and power of two won't meet this requirement
     //decimal number 8 has binary format: 0000-0000-0000-0000-0000-0000-0000-1000
