LeetCode练习-翻转数字（Reverse Integer）

最新推荐文章于 2021-08-03 23:21:34 发布

原创最新推荐文章于 2021-08-03 23:21:34 发布 · 546 阅读

0 ·

CC 4.0 BY-SA版权

编程练习专栏收录该内容

4 篇文章

订阅专栏

这是一篇关于LeetCode的编程练习，挑战是反转32位整数。文章介绍了如何处理翻转过程中可能遇到的溢出问题，并提供了相关代码实现。

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

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.

代码：

public class Test7 {
	
	public int reverse(int x) {
		int rev = 0;
		while (x != 0) {
			if (rev != 0 && Integer.MAX_VALUE / rev < 10&& Integer.MAX_VALUE / rev > -10)
				return 0;
			rev = rev * 10 + x % 10;
			x = x / 10;
		}

		return rev;
	}

	public static void main(String[] args) {
		System.out.println(new Test7().reverse(-2147483412));
	}
}