回文数（提交成功代码）

MouCoder · MouCoder · commit b9a16e6c2b89 · 2020-08-18T19:50:26.000+08:00
diff --git a/HuiWenShu/Solution.java b/HuiWenShu/Solution.java
@@ -0,0 +1,28 @@
+package LeetCode.HuiWenShu;
+
+import java.util.ArrayList;
+
+public class Solution {
+    public boolean isPalindrome(int x) {
+        if(x < 0)
+            return false;
+        else {
+            int y = x;
+            ArrayList<Integer> arry = new ArrayList<>();
+            int i = 0,n=1;
+            int result=0;
+            while(x!=0){
+                arry.add(x%10);
+                x /= 10;
+            }
+            for(int j = arry.size()-1;j>=0;j--) {
+                result += (arry.get(j))*n;
+                n *= 10;
+            }
+            if(y == result)
+                return true;
+            else
+                return false;
+        }
+    }
+}
diff --git a/HuiWenShu/Test.java b/HuiWenShu/Test.java
@@ -0,0 +1,8 @@
+package LeetCode.HuiWenShu;
+
+public class Test {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        System.out.println(sol.isPalindrome(121));
+    }
+}
