leetcode 7. Reverse Integer
2016-07-24 22:51
387 查看
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?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
这道题有两点要注意的,
一个就是如果输入1000,输出是1,而不是0001,
第二个是注意越界的问题,Max Integer是2147483647,但是如果翻转过来,第一位是7,肯定超过了整数的范围,所以在反转过程中要检查是否溢出。
当然还有一点值得注意的就是符号的问题。要先转化成long再取绝对值,因为min integer是-2147483648,取绝对值得不到对应的值。
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?
For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
这道题有两点要注意的,
一个就是如果输入1000,输出是1,而不是0001,
第二个是注意越界的问题,Max Integer是2147483647,但是如果翻转过来,第一位是7,肯定超过了整数的范围,所以在反转过程中要检查是否溢出。
当然还有一点值得注意的就是符号的问题。要先转化成long再取绝对值,因为min integer是-2147483648,取绝对值得不到对应的值。
public class Solution { public int reverse(int x) { if(x==Integer.MIN_VALUE) return 0; long result = 0; int i = 0; int temp = (x>0)?1:0; x = Math.abs(x); while(x != 0){ result *= 10; result += x%10; x /= 10; if(result > Integer.MAX_VALUE || result < Integer.MIN_VALUE) return 0; } return (temp==1)?(int)result:(int)-result; } }
相关文章推荐
- QPainter绘制图形
- javax.crypto.BadPaddingException: Given final block not
- Android 创建抽屉导航
- 【杭电2007】平方和与立方和
- leetcode 7. Reverse Integer
- 方法的绑定
- Intent实现有返回结果与无返回结果的页面跳转
- 判断图片是否加载完成的三种方式
- 我读过的最好的epoll讲解--转自”知乎“
- 请求包含,转发,重定向的区别
- Lintcode:分糖果
- Java迭代器
- 精通IOS-在表单元中添加子视图
- ASR自动语音识别技术
- NIO学习--核心概念与基本读写
- Java三大框架之struts的防止重复提交
- 逻辑数据库设计 - 单纯的树(递归关系数据)
- Hbase--6 Hbase协处理器
- 全国电子设计竞赛 (经验之谈)
- android之ImageView+Gallery组件的应用