每日算法题：19.6.19

题目：

判断一个整数是否是回文数。回文数是指正序（从左向右）和倒序（从右向左）读都是一样的整数。

示例：

输入: 121

输出: true

代码：

public class Test1 {
    public static void main(String[] args) {
        boolean palindrome = new Test1().isPalindrome(121);
        System.out.println("palindrome = " + palindrome);
        boolean palindrome1 = new Test1().isPalindrome(-121);
        System.out.println("palindrome1 = " + palindrome1);
        boolean palindrome2 = new Test1().isPalindrome(10);
        System.out.println("palindrome2 = " + palindrome2);
    }
    public boolean isPalindrome(int x) {
        if (x<0){
            return false;
        }
        int length=0;
        int temp = x;
        while (temp>0){
            length++;
            temp=temp/10;
        }
        int[] ints = new int[length];
        int intsIndex = 0;
        while (x > 0) {
            ints[intsIndex++] = x%10;
            x = x/10;
        }

        boolean result =true;
        int i = 0;
        int j = length-1;
        while (i<j){
            if (ints[i]!=ints[j]) {
                result = false;
                break;
            }
            i++;
            j--;
        }
        return result;
    }
}