class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
string a=to_string(x);
int n=a.size();
for(int i=0;i<n/2;i++)
if(a[i]!=a[n-i-1]) return false;
return true;
}
};
class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
string a=to_string(x);
string b=a;
reverse(a.begin(),a.end());
return a==b;
}
};
反向迭代器
class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
string a=to_string(x);
return a == string(a.rbegin(),a.rend());
}
};