LeetCode Reverse Integer

class Solution {
public:
    int reverse(int x) {
        long long ans=0;
        bool symbol=-1;
        if (x>0) {
            symbol=1;
        }
        while (x) {
            ans=ans*10+x%10;//有可能溢出
            if (ans>INT_MAX||ans<INT_MIN) {
                ans=0;
                break;
            }
            x/=10;
        }
        return ans*symbol;
    }
    
};