LeetCode-7

class Solution {
public:
    int reverse(int x) {
        int result = 0;
        while(x != 0){
            int tail = x % 10;
            int newResult = result*10 + tail;
            if((newResult - tail)/10 != result){
                return 0;
            } 
            result = newResult;
            x /= 10;
        }
        return result;
        
    }
};

主要是判断是否溢出。