[LeetCode]7. Reverse Integer

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 environmentwhich could only store integers within the 32-bit signed integerrange: [−231, 231 − 1]. For the purpose of this problem, assume thatyour function returns 0 when the reversed integer overflows.

注意越界问题
public int reverse(int x) {
long t=x;
if(t<0) t=-t;
long nt=Long.parseLong(new StringBuilder(t+””).reverse().toString());
if(x<0) nt=-nt;
if(nt>Integer.MAX_VALUE || nt<Integer.MIN_VALUE) return 0;
return (int)nt;
}

评论

发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注

这个站点使用 Akismet 来减少垃圾评论。了解你的评论数据如何被处理