https://leetcode.com/problems/palindrome-number/
class Solution {
public:
bool isPalindrome(int x) {
vector <int> num;
int temp;
if (x<0)
return 0;
while (x>0)
{
temp=x%10;
x=x/10;
num.push_back(temp);
}
int i=0, j=num.size()-1;
while (i<j)
{
if (num[i]!=num[j])
return 0;
i++;
j--;
}
return 1;
}
};
class Solution {
public:
bool isPalindrome(int x) {
int temp;
if (x<0 || (x % 10 == 0 && x != 0))
return 0;
int revertedNumber = 0;
while(x > revertedNumber) {
revertedNumber = revertedNumber * 10 + x % 10;
x /= 10;
}
return x == revertedNumber || x == revertedNumber/10;
}
};