leetcode_Palindrome Number

问题描述：Determine whether an integer is a palindrome. Do this without extra space.

               判断一个整数是不是回文数，并且不借助额外的空间

解决思路：一个回文数反转之后还是它本身package com.main;

package com.main;public class Palindrome {//判断是不是回文数//思路：将整数反转如果和原来相等，就是回文public static boolean isPalindrome(int x){    if(x<0) return false;    int val = x;    int total = 0;    int end = 0;    while(val > 0){        total *= 10;        end = val%10;        val/=10;        total += end;    }    return total == x;}public static void main(String[] args) {// TODO Auto-generated method stubSystem.out.println(isPalindrome(32121));}}