LeetCode--Reverse Integer

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_36124194/article/details/82731171

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.

分析

这里主要掌握判断32bits溢出的方法。

源码

class Solution {
public:
    int reverse(int x) {
        long long result = 0;
        while(x != 0) {
        	int n = x%10;
        	x = x/10;
        	result = 10*result + n;
        	//cout << n << endl;
        }
        return (result < INT_MIN || result > INT_MAX) ? 0 : result;
    }
};