LeetCode T9 Palindrome Number

题目地址：

中文：https://leetcode-cn.com/problems/palindrome-number/
英文：https://leetcode.com/problems/palindrome-number/

题目描述：

Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.

Follow up: Could you solve it without converting the integer to a string?

Example 1:

Input: x = 121
Output: true

Example 2:

Input: x = -121
Output: false
Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.

Example 3:

Input: x = 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a palindrome.

Example 4:

Input: x = -101
Output: false

Constraints:

-2^31 <= x <= 2^31 - 1

思路：

防到个数组里比对一下。。
是不是可以翻转过来相加看是不是等于原来的二倍，感觉这思路可行

题解：

class Solution {
    public boolean isPalindrome(int x) {
        int temp[] = new int[15];
        for(int i=0;i<15;i++) temp[i] = 0;
        if(x<0) return false;
        else if(x==0) return true;
        else {
            int i=0;
            while(x!=0)
            {
                temp[i++] = x%10;
                x/=10;
            }
            for(int j=0;j<i/2;j++) if(temp[j]!=temp[i-j-1]) return false;
        }
        return true;
    }
}