从零开始的LC刷题(2): Reverse Integer

原题：

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:

Input: 123
Output: 321

Example 2:

Input: -123
Output: -321

Example 3:

Input: 120
Output: 21

Note:
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

也是一道简单的题不涉及什么算法但是要注意int数据的溢出问题

结果：

Success

Runtime: 4 ms, faster than 100.00% of C++ online submissions for Reverse Integer.

Memory Usage: 8 MB, less than 100.00% of C++ online submissions for Reverse Integer.

代码：

class Solution {
public:
    int reverse(int x){
        int mx=INT_MAX;
        int mn=INT_MIN;
        int result=0;
        while(x!=0){
            int temp=x%10;
            if (result>mx/10||(result==mx/10&&temp>7)||result<mn/10||(result==mn&&temp<-8)){return 0;}
            result=result*10+temp;
            x/=10;
            
        }
        return result;
    
        
    }
};