【LeetCode】7.Reverse Integer

class Solution {
public:
    int reverse(int x) {
        vector<int> num;
        int result = 0;
        if(result == x)
            return result;
        while(x%10 == 0)
            x = x/10;
        
        while(x/10 != 0)
        {
            num.push_back(x%10);
            x = x/10;
        }
        num.push_back(x);
        for(int i = 0; i < num.size(); i++)
        {
            int tem = result;
            result =result + num[i]*( pow(10, (num.size()-1-i)) );//10的次方，不是10*数字
            if (result-num[i] * (pow(10, (num.size() - 1 - i))) != tem)//判断是否int溢出
            {
                result = 0;
                break;
            }
        }
        return result;
    }
};