9.回文数
关键是记住这个回文数的代码块
bool hws(long long n)
{
long long ans=0,m=n;
while(m>0)
{
ans=ans*10+m%10;
m/=10;
}
x=ans;
return ans==n;
}
class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
long long int cnt = 0;
long long int t = x;
while(t != 0)
{
cnt = cnt * 10 + t % 10;
t /= 10;
}
return cnt == x;
}
};