7.Reverse Integer

最新推荐文章于 2022-07-25 11:26:23 发布

石前有座桥

最新推荐文章于 2022-07-25 11:26:23 发布

阅读量92

点赞数

分类专栏： leetcode-easy

本文链接：https://blog.csdn.net/lyw_321/article/details/89029311

版权

leetcode-easy 专栏收录该内容

121 篇文章 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.

反转32位Int整数，溢出则返回0。并且去掉前面多余的0.

class Solution {
public:
    int reverse(int x) {
        long long sum=0;
        while(x){
            sum=sum*10+x%10;
            x=x/10;
        }
        int  maxn=(1<<31)-1;
        int minn=(1<<31);
        return sum>maxn||sum<minn?0:sum;
    }
};