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 palindrome.
Follow up:
Coud you solve it without converting the integer to a string?
这题正好用到上一题的方法
代码:
class Solution { public boolean isPalindrome(int x) { if(x<0){ return false; }else{ int y = 0; int z = x; while(x/10!=0){ y*=10; y+=x%10; x/=10; } y=y*10+x; if(y==z){ return true; }else{ return false; } } } }
负数都不成功,所以直接报false