LeetCode 7. Reverse Integer
2016-03-19 15:15
225 查看
Reverse digits of an integer.
Example1: x = 123, return 321Example2: x = -123, return -321
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.
My Solution
public class Solution { public int reverse(int x) { long result=0; while(x!=0){ result=result*10+x%10; if(result>Integer.MAX_VALUE||result<Integer.MIN_VALUE) return 0; x/=10; } return (int)result; } }
相关文章推荐
- 迁移/备份oracle12c服务器数据
- 自动repo sync脚本
- 最小圆覆盖
- MYSQL 5.7.11解压版配置
- (1)排序算法——选择排序
- Get和Post
- 学习进度第三周
- jspsmartupload 文件上传让input数据和文件上传同时提交
- 134. Gas Station | Java最短代码实现
- NOIP2013P4 车站分级 题解
- Hibernate学习——(八)基于Annotation的多对一、一对多映射
- 大家一起和snailren学java-(序)
- String字符串转Byte
- hdu 2609 Coin Change
- Oracle建表SQL语句实现id自增
- 正式作为程序员的第一天
- Redis、Memcached简单封装
- VS2013安装及测试练习
- 第二篇学习笔记
- c语言中的“/”和“%”运算