整数反转&回文数

class Solution {
    
    
public:
    int reverse(int x) {
    
    
    long n = 0,answer=0;
	while (x)
	{
    
       
        n=x%10;
		x /= 10;
        answer=answer*10+n;
	}
	return answer > INT_MAX || answer < INT_MIN ? 0 : answer;
    }
};

class Solution {
    
    
public:
    bool isPalindrome(int x) {
    
    
        long answer=0,c=x;
        while(c>0){
    
    
            answer=answer*10+c%10;
            c=c/10;
        }
        if(answer==x){
    
    
            return true;
        }
        else{
    
    
            return false;
        }
    }
};