edit 7

fishercoder1534 · fishercoder1534 · commit 0ae9b0555795 · 2017-06-11T22:39:26.000-07:00
diff --git a/README.md b/README.md
@@ -512,7 +512,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |10|[Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RegularExpressionMatching.java)|O(m*n)|O(m*n)|Hard|DP
 |9|[Palindrome Number](https://leetcode.com/problems/palindrome-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PalindromeNumber.java)| O(logn)/(n) | O(1) | Easy
 |8|[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_8.java)| O(n) | O(1) | Medium
-|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/ReverseInteger.java) | O(1) | O(1) | Easy | 
+|7|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_7.java) | O(1) | O(1) | Easy | 
 |6|[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_6.java) | O(n) | O(n) | Easy | 
 |5|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5.java) | O(n^2) | O(1) | Medium|
 |4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_4.java) | ? | ? | Hard | Divide and Conquer
diff --git a/src/main/java/com/fishercoder/solutions/_7.java b/src/main/java/com/fishercoder/solutions/_7.java
@@ -4,7 +4,7 @@
 
 Example1: x = 123, return 321
 Example2: x = -123, return -321*/
-public class ReverseInteger {
+public class _7 {
     public int reverse_short_version(int x){
         long rev = 0;
         while(x != 0){
@@ -44,7 +44,7 @@ public int reverse(int x) {
     }
     
     public static void main(String...strings){
-        ReverseInteger test = new ReverseInteger();
+        _7 test = new _7();
         //when the input is 1534236469, it's expecting 0 as the correct answer, this is due to its reversed number is greater than Integer.MAX_VALUE, thus return 0
         System.out.println(1534236469 > Integer.MAX_VALUE);
         System.out.println("1534236469\n" + Integer.MAX_VALUE);
