Reverse Integer
来源:互联网 发布:中信银行客户端软件 编辑:程序博客网 时间:2024/04/30 00:38
Q:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: 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?
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).
Solution:
public class Solution { public int reverse(int x) { int rest = x % 10; int result = rest; while (x != rest) { x = (x - rest) / 10; rest = x % 10; result = result * 10 + rest; } return result; }}
0 0
- Reverse Integer
- Reverse Integer
- Reverse Integer
- reverse integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- Reverse Integer
- reverse Integer
- Reverse Integer
- Reverse integer
- Reverse Integer
- Reverse Integer
- objc 类型转换
- php Laravel框架学习(三) 之 路由
- TookKit-autohotkey_Simple automation of Windows and programs
- eclipse 的一些常用的快捷键。。。很有帮助。
- 序列最小优化算法
- Reverse Integer
- PAT 2-12 两个有序链表序列的交集(C语言实现)
- Appium测试安卓Launcher以滑动窗体获得目标应用
- IOS开源框架及他人经验
- HDU - 5008 Boring String Problem (后缀数组+二分+RMQ)
- poj1426 同余模定理+二叉树
- 大型网站系统架构的演化
- C语言、C++面试题(附答案)
- Leetcode: Unique Paths