LeetCode: Reverse Integer
来源:互联网 发布:软件著作权申请条件 编辑:程序博客网 时间:2024/04/28 22:20
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).
class Solution {public: int reverse(int x) { // Start typing your C/C++ solution below // DO NOT write int main() function int inv = 1; if (x < 0) { inv = -1; x = abs(x); } int result = 0; while(x) { int tmp = x % 10; result = result * 10 + tmp; x = x / 10; } return inv*result; }};
- 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
- 关于URL编码
- 动态改变页面中iframe
- windows下架设subversion服务器
- encodeURIComponent为什么使用两遍?
- 简记update碰到的一个小问题
- LeetCode: Reverse Integer
- 比大小
- Java堆内存的10个要点
- Java学习笔记9——多线程
- java 大数末尾去0 java 读取字符串
- 面试题---->旋转字符串
- EOF与getchar
- 一个长度为N的整形数组,数组中每个元素的取值范围是[0,N-1],写一个算法判断数组中是否存在重复的数字
- 国庆假期第一周