refactor 9

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_9.java

@@ -17,28 +17,9 @@
  */
 public class _9 {
 
-    public static class Solution1 {
-        public boolean isPalindrome(int x) {
-            if (x == 0) {
-                return true;
-            }
-            if (x < 0) {
-                return false;
-            }
-            int rev = 0;
-            int tmp = x;
-            while (tmp != 0) {
-                rev *= 10;
-                rev += tmp % 10;
-                tmp /= 10;
-            }
-            return rev == x;
-        }
-    }
-
     /**credit: https://discuss.leetcode.com/topic/8090/9-line-accepted-java-code-without-the-need-of-handling-overflow
      * reversing only half and then compare if they're equal.*/
-    public static class Solution2 {
+    public static class Solution1 {
         public boolean isPalindrome(int x) {
             if (x < 0) {
                 return false;

src/test/java/com/fishercoder/_9Test.java

@@ -8,36 +8,30 @@
 
 public class _9Test {
     private static _9.Solution1 solution1;
-    private static _9.Solution2 solution2;
 
     @BeforeClass
     public static void setup() {
         solution1 = new _9.Solution1();
-        solution2 = new _9.Solution2();
     }
 
     @Test
     public void test1() {
         assertEquals(false, solution1.isPalindrome(2147483647));
-        assertEquals(false, solution2.isPalindrome(2147483647));
     }
 
     @Test
     public void test2() {
         assertEquals(true, solution1.isPalindrome(0));
-        assertEquals(true, solution2.isPalindrome(0));
     }
 
     @Test
     public void test3() {
         assertEquals(true, solution1.isPalindrome(1));
-        assertEquals(true, solution2.isPalindrome(1));
     }
 
     @Test
     public void test4() {
         assertEquals(false, solution1.isPalindrome(10));
-        assertEquals(false, solution2.isPalindrome(10));
     }
 
 }