Given a 32-bit signed integer, reverse digits of an integer. Note: Assume we are dealing with an environment that 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.
Example 1: Input: x = 123 Output: 321
Example 2: Input: x = -123 Output: -321
Example 3: Input: x = 120 Output: 21
Example 4: Input: x = 0 Output: 0
Constraints:
-231 <= x <= 231 - 1
这个要考虑的溢出的问题！！！！！！！！！ 如果溢出了，返回0
package com.company; import java.util.Scanner; public class ReverseInteger7 { public static int reverse(int x) { long n = 0; while(x != 0) { n = n*10 + x%10; x = x/10; } return (int)n==n? (int)n:0; } public static void main(String[] args) { int x; while (true) { Scanner scn = new Scanner(System.in); x = scn.nextInt(); System.out.println(reverse(x)); } } }