LeetCode——007 Reverse Integer

最新推荐文章于 2021-09-17 19:55:55 发布

自由の翼Az

最新推荐文章于 2021-09-17 19:55:55 发布

阅读量72

点赞数

分类专栏： LeetCode 文章标签：数值

本文链接：https://blog.csdn.net/weixin_42637495/article/details/104403516

版权

LeetCode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Description

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.

Solution:

翻转一个带字符整数
最高数值为【-2^31 - 2^31-1】32位系统，由于int型的数值范围是 -2147483648～2147483647，

int reverse(int x) {
	int rev = 0;
	while (x != 0) {
		int pop = x % 10;
		x /= 10;
		if (rev > INT_MAX / 10 || (rev == INT_MAX / 10 && pop > 7)) return 0;
		if (rev < INT_MIN / 10 || (rev == INT_MIN / 10 && pop < -8)) return 0;
		rev = rev * 10 + pop;
	}
	return rev;
}

	class Solution {
public:
    int reverse(int x) {
        int res = 0;
        while (x != 0) {
            if (abs(res) > INT_MAX / 10) return 0;
            res = res * 10 + x % 10;
            x /= 10;
        }
        return res;
    }
};