【LeetCode】Reverse Integer
来源:互联网 发布:网络推广计划表 编辑:程序博客网 时间:2024/06/14 23:25
题目
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
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?
Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).
解答注意,若反转后的数超出整型范围,则会变成负数,还有,注意处理反转的方法。
public class Solution { public int reverse(int x) { boolean position=(x<0)?false:true; int result=0; x=Math.abs(x); while(x>0){ result=result*10+x%10; x/=10; } if(result<0) return -1; if(!position) result*=-1; return result; }}
---EOF---
0 0
- LeetCode:Reverse Integer
- LeetCode: Reverse Integer
- [Leetcode] Reverse Integer
- LeetCode : Reverse Integer
- [LeetCode] Reverse Integer
- Leetcode: Reverse Integer
- LeetCode 7 - Reverse Integer
- leetcode 104: Reverse Integer
- Leetcode : Reverse Integer
- 【leetcode】Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode-Reverse Integer
- [leetcode] Reverse Integer
- LeetCode - Reverse Integer
- leetcode之Reverse Integer
- LeetCode | Reverse Integer
- LeetCode: Reverse Integer
- Leetcode: Reverse Integer
- Ubuntu常用命令大全
- thinkphp 404页面设置
- Python搜索文件
- java 数据流DataOutputStream和DataInputstream
- 【Leetcode系列之一】Leetcode OJ 10道入门题研究
- 【LeetCode】Reverse Integer
- [c.y.j]spring redis utils
- uva10250
- 并发管理器1——概念
- Sublimetext3如何安装packagecontrol办法娇
- 20140503
- 黑马程序员---类和构造方法
- js:对象的创建(为prototype做铺垫)
- Linux下which、whereis、locate、find 命令的区别