edit 190

fishercoder1534 · fishercoder1534 · commit 697e6e65b504 · 2017-07-24T18:39:40.000-07:00
diff --git a/README.md b/README.md
@@ -386,7 +386,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |199|[Binary Tree Right Side View](https://leetcode.com/problems/binary-tree-right-side-view/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_199.java)| O(n)|O(n)| Medium | BFS 
 |198|[House Robber](https://leetcode.com/problems/house-robber/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_198.java)| O(n)|O(n)| Easy | DP
 |191|[Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_191.java)| O(n)|O(1)| Easy | Bit Manipulation
-|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ReverseBits.java)| O(n)|O(1)| Easy | Bit Manipulation
+|190|[Reverse Bits](https://leetcode.com/problems/reverse-bits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_190.java)| O(n)|O(1)| Easy | Bit Manipulation
 |189|[Rotate Array](https://leetcode.com/problems/rotate-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_189.java)| O(n)|O(n), could be optimized to O(1) | Easy
 |188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_188.java)| O(n*k)|O(n*k) | Hard | DP
 |187|[Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_187.java)| O(n)|O(n) | Medium
diff --git a/src/main/java/com/fishercoder/solutions/_190.java b/src/main/java/com/fishercoder/solutions/_190.java
@@ -8,7 +8,7 @@
 
 Follow up:
 If this function is called many times, how would you optimize it?*/
-public class ReverseBits {
+public class _190 {
     /**This post: http://stackoverflow.com/questions/2811319/difference-between-and
      * gives a good explanation between logical right shift: ">>>" and arithmetic right shift: ">>".
      * Basically, ">>" preserves the most left bit and treats it as the sign for this number,
@@ -35,7 +35,7 @@ public int reverseBits(int n) {
     
     public static void main(String...strings){
         System.out.println(Integer.toBinaryString(4));
-        ReverseBits test = new ReverseBits();
+        _190 test = new _190();
         int n = 1;
         System.out.println(test.reverseBits(n));
         System.out.println(Integer.parseInt("11000", 2));
