class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
if(x<10) return true;
int n = 0;
int y = x;
while(y){
n++;
y /= 10;
}
int left = pow(10, n - 1);
int right = 1;
while(left>=right){
if(x / left % 10 != x / right % 10) return false;
left /= 10;
right *= 10;
}
return true;
}
};
[Leetcode]Palindrome Number
最新推荐文章于 2021-10-15 15:40:03 发布