LeetCode 7. 整数反转

题目描述:

解法:

class Solution {
public:
    int reverse(int x) {
        int res=0;
        int rem;    //余数
        while(x!=0){
            rem=x%10;    
            x/=10;
            if(res>INT_MAX/10||(res==INT_MAX/10&&rem>7)) return 0;    //上溢
            if(res<INT_MIN/10||(res==INT_MIN/10&&rem<-8)) return 0;    //下溢
            res=res*10+rem;
        }
        return res;
    }
};
原文地址:https://www.cnblogs.com/oneDongHua/p/14264021.html