class Solution {

public:

    int reverse(int x) {

        if(x == )

            return ;

        bool isNegative = false;

        if(x<)

        {

            isNegative = true;

            x = -x;

        }

        vector<int> num;

        while(x!=)

        {

            num.push_back( x%);

            x = x/;

        }

        int ans = ;

        for(int i = ;i<num.size();i++)

        {

            ans = ans * ;

            ans += num[i];

        }

        if(isNegative)

            ans = ans*(-);

        return ans;

    }

};