判断整数回文

#include<iostream>
#include<string>

using namespace std;

class Solution{
    public:
    bool isPalindrome(int x){
        string str = to_string(x);
        int left =0, right = str.size() - 1;
        while(left < right){
            if(str[left] != str[right]){
                return false;
            }
            left++;
            right--;
        }
        return true;

    }

};

bool isPalindrome(int x) {
    if(x<0||x%10==0&&x!=0)return false;
    int reversedHalf=0;
    while(x>reversedHalf){
        reversedHalf=reversedHalf*10+x%10;
        x/=10;
    }
    return x==reversedHalf||x==reversedHalf/10;
}