LeetCode题目7. Reverse Integer
来源:互联网 发布:3d平面设计软件 编辑:程序博客网 时间:2024/05/16 12:44
题目原址:点击打开链接
题目描述:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
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.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows
我的代码:
class Solution {public: int reverse(int x) { long n=0; while(x!=0){ n=n*10+x%10; x=x/10; } if(n>2147483648||n<-2147483648)return 0; return n; }};
- LeetCode题目7. Reverse Integer
- LeetCode题目: 7.Reverse Integer
- [LeetCode]7.Reverse Integer
- LeetCode 7. Reverse Integer
- LeetCode --- 7. Reverse Integer
- LeetCode 7.Reverse Integer
- [Leetcode] 7. Reverse Integer
- [Leetcode]7.Reverse Integer
- LeetCode 7.Reverse integer
- [LeetCode] 7.Reverse Integer
- 7. Reverse Integer LeetCode
- leetcode 7. Reverse Integer
- leetcode 7. Reverse Integer
- leetcode 7. Reverse Integer
- Leetcode 7. Reverse Integer
- 【LeetCode】7.Reverse Integer
- LeetCode 7. Reverse Integer
- LeetCode *** 7. Reverse Integer
- MFC 多个RadioButton设为一组 vs2013
- nio的实现原理
- 谈一谈苹果原生的布局框架 NSLayoutConstraint 和 VFL
- Retrofit 2.X使用详解之请求头
- 路由器web界面分析(四)---学会追踪标签
- LeetCode题目7. Reverse Integer
- 新闻客户端
- Gradle依赖管理
- 为何数据视觉化越来越火
- 轻松搞定内存对齐
- TLS握手协商流程解析
- Lucene学习笔记 -- day06 索引库的维护
- SIGPIPE信号
- 2、java的定时器