413 反转整数

class Solution {
public:
    /**
     * @param n: the integer to be reversed
     * @return: the reversed integer
     */
    int reverseInteger(int n) {
        // write your code here

    int m=n,result=0;
    vector<int> tmp;
    while(m)
    {
        tmp.push_back(m%10);
        m=m/10;
    }
    int size=tmp.size();
    for (int i=0;i<size;i++)
    {
        result=result+tmp[i]*pow(10.0,size-1-i);
        if (result>=INT_MAX||result<=INT_MIN)
        {
            return 0;
        }
    }
    return result;
    }
};