Leetcode: Reverse Integer

最新推荐文章于 2021-01-09 00:40:58 发布

「已注销」

最新推荐文章于 2021-01-09 00:40:58 发布

阅读量1w

点赞数

CC 4.0 BY-SA版权

分类专栏：程序员笔试面试 Leetcode 算法与数据结构文章标签： Leetcode Reverse Integer

本文链接：https://blog.csdn.net/doc_sgl/article/details/12190507

程序员笔试面试同时被 3 个专栏收录

223 篇文章

订阅专栏

算法与数据结构

223 篇文章

订阅专栏

Leetcode

179 篇文章

订阅专栏

本文探讨了如何实现整数反转并处理边界情况，包括最后一位为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?

Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).

一开始这样写：

int reverse(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(-10 < x && x < 10) return x;
    	bool ispositive = true;
		if(x < 0) {ispositive = false; x = -x;}
		
		long res = 0;
		while(x)
		{
			res = res*10 + x%10;
			x /= 10;
		}
		if(!ispositive)
			res = -res;
		return res;
    }

后来这样写：

int reverse(int x) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
		
		long res = 0;
		while(x)
		{
			res = res*10 + x%10;
			x /= 10;
		}
		return res;
    }