LeetCode OJ Reverse Integer
来源:互联网 发布:捡宝贝淘宝u站 编辑:程序博客网 时间:2024/05/25 05:38
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?
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).
class Solution {public: int reverse(int x) { int positive = 1; if (x < 0) { positive = -1; x = -x; } long long int ans = 0; while (x) { ans = ans * 10 + x % 10; x /= 10; } return ans * positive; }};
0 0
- LeetCode OJ:Reverse Integer
- LeetCode OJ - Reverse Integer
- LeetCode OJ : Reverse Integer
- [LeetCode OJ]Reverse Integer
- Reverse Integer | LeetCode OJ
- Leetcode Oj Reverse Integer
- LeetCode OJ Reverse Integer
- LeetCode OJ----Reverse Integer
- LeetCode OJ - Reverse Integer
- LeetCode OJ ---- Reverse Integer
- Leetcode OJ :Reverse Integer
- [LeetCode OJ][007]Reverse Integer
- LeetCode OJ 0 Reverse Integer
- 【LeetCode OJ 007】Reverse Integer
- <LeetCode OJ> 7. Reverse Integer
- LeetCode OJ 7. Reverse Integer
- LeetCode OJ 7. Reverse Integer
- LeetCode OJ(7.Reverse Integer)
- 程序员的内功——算法
- LeetCode OJ LRU Cache
- UVa 1647 - Computer Transformation(大数)
- LeetCode OJ Letter Combinations of a Phone Number
- LeetCode OJ Add Two Numbers
- LeetCode OJ Reverse Integer
- COJ--1541: There is No Alternative
- boost xpressive简明用法
- SVN与TortoiseSVN实战:冲突详解(二)
- JAVA创建单例的5中常见方式及比较
- LeetCode OJ Pow(x, n)
- jdbC连接到数据库
- LeetCode OJ Merge k Sorted Lists
- mybatis报错java.lang.ClassCastException: java.lang.String cannot be cast to java.lang.Long