init leetcode respo

Author: zhangbo54

.idea/workspace.xml

@@ -4,4 +4,17 @@
  * Created by zhangbo54 on 2019-03-01.
  */
 public class Main {
+    static
+    class Solution {
+        public int reverse(int x) {
+            Long result = 0L;
+            while (x != 0) {
+                result = result * 10 + x % 10;
+                x = x / 10;
+            }
+            return result > Integer.MAX_VALUE || result < Integer.MIN_VALUE ? 0 : result.intValue();
+        }
+    }
 }
+
+

src/leetcode/_7_Reverse_Integer/Main.java

@@ -6,13 +6,13 @@
 public class Main {
     public static void main(String[] args) {
         Solution solution = new Solution();
-        System.out.println(solution.myAtoi(" "));
+        System.out.println(solution.isPalindrome(""));
         // Integer.parseInt("1" + Integer.MAX_VALUE);
     }
 
     static
     class Solution {
-        public int myAtoi(String str) {
+        public int isPalindrome(String str) {
             str = str.trim();
             StringBuilder sb = null;
             boolean started = false;
@@ -53,4 +53,5 @@ public int myAtoi(String str) {
             }
         }
     }
+
 }

src/leetcode/_8_String_to_Integer_atoi/Main.java

@@ -0,0 +1,31 @@
+package leetcode._9_Palindrome_Number;
+
+/**
+ * Created by zhangbo54 on 2019-03-01.
+ */
+public class Main {
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.isPalindrome(1));
+        // Integer.parseInt("1" + Integer.MAX_VALUE);
+    }
+
+    static
+    class Solution {
+        public boolean isPalindrome(int x) {
+            if (x < 0) {
+                return false;
+            }
+            if (x < 10) {
+                return true;
+            }
+            char[] charArray = String.valueOf(x).toCharArray();
+            for (int i = 0, j = charArray.length - 1; i < j; i++, j--) {
+                if (charArray[i] != charArray[j]) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}