leetcode Reverse Integer
2015-05-25 23:47
429 查看
Reverse Integer
TotalAccepted: 73083 TotalSubmissions: 281068MySubmissions
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;
}
相关文章推荐
- LeetCode Reverse Integer
- LeetCode——Reverse Integer
- LeetCode : Reverse Integer [java]
- [LeetCode] Reverse Integer、Palindrome Number
- LeetCode 第 7 题(Reverse Integer)
- leetcode Reverse digits of an integer(经测试绝对正确)
- [Week 1]【Leetcode】Reverse Integer(逆序问题)
- 【LeetCode】- Reverse Integer(将一个整数反转)
- [Leetcode] reverse integer 反转整数
- leetcode-007-Reverse Integer
- leetcode Reverse integer
- LeetCode: Reverse Integer,Palindrome Number
- LeetCode (7)Reverse Integer
- LeetCode_reverse integer_007
- leetcode上reverse integer的C语言代码
- Reverse Integer -leetcode
- Reverse Integer--LeetCode(Java)
- Reverse Integer Leetcode Python Java
- leetcode-07-reverse integer-python
- LeetCode Reverse Integer