LeetCode7 颠倒整数 2018.4.11

最新推荐文章于 2022-06-21 16:49:13 发布

瓜不田

最新推荐文章于 2022-06-21 16:49:13 发布

阅读量176

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/Jerseywwwwei/article/details/79900975

版权

LeetCode 专栏收录该内容

68 篇文章 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 hold integers within the 32-bit signed integer range. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

#include <iostream>
#include <vector>
#include<string.h>
#include<algorithm>
#include<string>
#include <unordered_map>
using namespace std;
class Solution
{
    public:
    int reverse(int x)
    {
        int result = 0;
        int temp;
        int flag = 1;
        if(x < 0)
            flag = -1;
        x = abs(x);
        while(x)
        {
            temp = x % 10 + result * 10;
            if(temp / 10 != result)//这题的精髓就在这里，借鉴了以下别人，如果不相等，那么就已经溢出了，不用再计算完再通过INX_MAX之类的比较
                return 0;
            result = temp;
            x = x/10;
        }
        result = result * flag;
        return result;
    }
};
int main()
{
    Solution solution;
    cout<<solution.reverse(123)<<endl;
}