leetcode--reverse_integer
2016-10-24 11:28
323 查看
leetcode–reverse_integer
题意:将一个int类型的数反转举例:x=123,return 321; x=-123, return -321;
warning:
如果integer最后一位是0,该怎么输出;
反转后的integer有可能越界,如1000000003,该如何处理这种情况(可以抛出异常,但本题不允许抛异常处理)。
本题比较简单,不做分析,直接贴代码
public class reverse_integer { public int reverse(int x) { long result = 0; while(x != 0){ result = result * 10 + x % 10; x = x / 10; } if(result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) return 0; else return (int)result; } }
源程序下载
相关文章推荐
- leetcode——Reverse Integer
- leetcode——7—— Reverse Integer可仿溢出
- 【LeetCode】7 & 8 - Reverse Integer & String to Integer (atoi)
- Leetcode 07 Reverse Integer(数字反转) && 09 Palindrome number(回文判断)
- LeetCode Reverse Integer
- leetcode(7) - Reverse Integer
- LeetCode Reverse Integer
- Reverse Integer && Palindrome Number-LeetCode
- Leetcode:Reverse Integer
- [leetcode]Reverse Integer 代码(C++)
- LeetCode-7-Reverse Integer-E
- LeetCode Reverse Integer
- [LeetCode] Reverse Integer 翻转整数
- leetcode: Reverse Integer 菜鸟解法
- LeetCode-7-Reverse Integer(C语言实现)
- 【leetcode】Reverse Integer(middle)☆
- LeetCode: Reverse Integer
- LeetCode: Reverse Integer
- LeetCode[7]Reverse Integer
- Leetcode 07 Integer Reverse问题