反转数

最新推荐文章于 2023-06-11 05:18:08 发布

15332019张胜利

最新推荐文章于 2023-06-11 05:18:08 发布

阅读量147

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/j515332019/article/details/83964190

版权

C++ 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

问题描述：

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.

解答：

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