leetcode-9

leetcode-9

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

Example 1:

Input: 121
Output: true
Example 2:

Input: -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: 10
Output: false
Explanation: Reads 01 from right to left. Therefore it is not a */

public class Solution9 {
	 public boolean isPalindrome(int x) {
			
			//把它调转过来
		    int a=x;
			int n=0;
			int reserve=0;
			while(x!=0) {
				n=n*10+x%10;
				x=x/10;
			}
			reserve=(int)n==n? (int)n:0;
			if(reserve==a&&a>=0) {
				return true;
			}else
				return false;
		    
		        
		   }
}