class Solution {
public:
bool isPalindrome(int x) {
if(x < 0)
return false;
vector<int> result;
int k,j=0,l=0;
while(x != 0){
k = x%10;
x /= 10;
result.push_back(k);
}
int len = result.size();
if(len%2 == 0){
for(int i = 0;i<len/2;i++){
if(result[i] == result[len-i-1])
j++;
}
if(j==len/2)
return true;
else
return false;
}
else{
for(int i=0;i<(len-1)/2;i++){
if(result[i] == result[len-i-1])
l++;
}
if(l==(len-1)/2)
return true;
else
return false;
}
}
};
leetcode-09-palindrome number
最新推荐文章于 2021-01-03 19:26:02 发布