leetcode ：reverse integer
2015-04-12 18:21
363 查看
Reverse Integer
Example1: x = 123, return 321Example2: x = -123, return -321
_________________________________
注意溢出问题的处理；int reverse(long long x) {
int flag = 0;
const long long max = 0x7fffffff; // long long 类型不管在32位还是在64位上，都是8个字节
const long long min = 0x80000000;
if (x < 0)
{
x = -x;
flag = -1;
}
long long sum = 0; //防止溢出
int a = 0;
while (x != 0)
{
sum = sum * 10;
a = x % 10;
sum = sum + a;
x = x / 10;
if (flag == 0 && sum > max)
{
return 0;
}
else if (flag == -1 && sum > abs(min))
{
return 0;
}
}
if (flag == -1)
sum = sum * (-1);
return sum;
}notice：当 min 定义为 int 型时，abs()函数 对其是没有作用的，即：不能将其变为正数。
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode 7 Reverse Integer
- C实现 LeetCode->Reverse Integer
- [LeetCode]题解（python）：007-Reverse Integer
- LeetCode | 7. Reverse Integer
- Java [leetcode 7] Reverse Integer
- LeetCode —— Reverse Integer
- Leetcode-Reverse Integer
- leetcode[7]Reverse Integer
- leetcode_7_Reverse Integer
- Leetcode 数 Reverse Integer
- leetcode python - Reverse Integer
- LeetCode | Reverse Integer
- LeetCode1 Reverse Integer
- [LeetCode] Reverse Integer
- 【leetcode】Reverse Integer
- LeetCode: missing num, count of 1s, roman to/from integer, decode ways, reverse integer
- leetcode - Reverse Integer
- 【leetcode】Reverse Integer
- [LeetCode] Reverse Integer
- Leetcode: Reverse Integer