LeetCode Reverse Integer、Palindrome Number

Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123
Output: 321
Example 2:Input: -123
Output: -321
Example 3:Input: 120
Output: 21
Note:
Assume we are dealing with an environment which could only hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.class Solution {
public:
int reverse(int x) {
long long res=0;
while(x)
{
res=res*10+x%10;
x/=10;
}
return (res<INT_MIN||res>INT_MAX)?0:res;
}
};Determine whether an integer is a palindrome. Do this without extra space.

/*坑点：负数不算回文串*/
class Solution {
public:
bool isPalindrome(int x) {
if(x<0) return false;
int cnt=0;
int a[15];
while(x)
{
a[cnt++]=x%10;
x/=10;
}
for(int i=0;i<cnt/2;i++)
{
if(a[i]!=a[cnt-i-1])
return false;
}
return true;
}
};