7. Reverse Integer

sunnylinner

于 2016-03-20 10:41:35 发布

阅读量364

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： LeetCode java

本文链接：https://blog.youkuaiyun.com/sunnylinner/article/details/50935516

LeetCode 专栏收录该内容

32 篇文章

订阅专栏

本文探讨了如何通过编程实现整数反转，并处理边界情况，如整数末尾为0和可能的溢出问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

click to show spoilers.

Have you thought about this?

Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!

If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.

Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?

For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

public class Solution {
    public int reverse(int x) {
        long res = 0;
        for (; x != 0; x /= 10)    //一位一位进行数据处理，拿末位放首位
            res = res * 10 + x % 10;
        return res > Integer.MAX_VALUE || res < Integer.MIN_VALUE ? 0: (int) res;
		//对最后的数据处理，溢出则返回0，不然返回数据
    }
}