leetcode Reverse Integer
来源:互联网 发布:剑网三mac可以玩吗 编辑:程序博客网 时间:2024/06/05 10:11
Reverse Integer
TotalAccepted: 73083 TotalSubmissions: 281068My Submissions
Question Solution
Reverse digits of an integer.
Example1: x = 123,return 321
Example2: x = -123, return -321
click to show spoilers.
本题就是将int翻转下,有正负。唯一的坑在于int翻转之后可能超过int的范围,所以要用double来定义,同时要判断是否超出范围,超出直接返回0即可。
Ac代码源码(有main()):
#include <iostream>
using namespace std;
int f(int x)
{
intmax =0x7fffffff;
intmin= 0x80000000;
doubley=0;
while(x)
{
y=y*10+x%10;
x/=10;
}
if(y>max||y<min)
y=0;
returny;
}
int main()
{
intn;
while(cin>>n)
cout<<f(n)<<endl;
return0;
}
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
- 2015百度之星资格赛1002列变位法解密
- Hadoop MapReduce处理海量小文件:基于CombineFileInputFormat
- 苹果开发 笔记(29)
- 将String转换为char数组或char指针
- 设计模式之------设计模式中类的关系
- leetcode Reverse Integer
- 【算法基础】由插入排序来看如何分析和设计算法
- Dalvik opcodes
- 6分钟彻底掌握存储和备份区别
- 实战:上亿数据如何秒查
- java内存泄露
- 1001—大搬家
- THINK IN JAVA##CHAPTER ONE
- Fragment随笔