(leetcode) Reverse Integer
来源:互联网 发布:网络计划图关键线路 编辑:程序博客网 时间:2024/06/04 22:47
题目
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
C++实现
class Solution {
public:
int reverse(int x) {
double result = 0;
while(x)
{
result = result*10 + x % 10;
x /= 10;
}
return ( result > INT_MAX || result < INT_MIN)? 0:result;
}
};
public:
int reverse(int x) {
double result = 0;
while(x)
{
result = result*10 + x % 10;
x /= 10;
}
return ( result > INT_MAX || result < INT_MIN)? 0:result;
}
};
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
- Java-二分查找算法
- QT学习笔记
- hadoop集群的负载均衡配置与添加DataNode节点和TaskTracker节点
- HDU5211——Mutiple
- 链表findMid方法总结
- (leetcode) Reverse Integer
- 图论- hdu5215 Cycle
- SSH 连接Ubuntu反应慢解决
- Java-二叉树算法
- HDOJ1074
- 简单的SSH登录功能实现
- null==undefined和null!==undefined
- 新建Cstock类,命名为listen,accept容易出现莫名错误
- String to Integer (atoi)