leetcode(7) - Reverse Integer
2016-10-12 21:34
274 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
int reverse(int x) {
long result=0; // 注意int型溢出的情况,所以这里定义long类型,防止溢出,然后再和INT_MAX INT_MIN比较
bool pos=true; // 符号
if(x<0){
pos=false;
x=(-1)*x;
}
int cur=x;
while(cur){
result = result*10 + cur%10;
cur=cur/10;
}
if(!pos)
result=(-1)*result;
if(result>INT_MAX || result<INT_MIN)
return 0;
return result;
}
Example1: x = 123, return 321
Example2: x = -123, return -321
int reverse(int x) {
long result=0; // 注意int型溢出的情况,所以这里定义long类型,防止溢出,然后再和INT_MAX INT_MIN比较
bool pos=true; // 符号
if(x<0){
pos=false;
x=(-1)*x;
}
int cur=x;
while(cur){
result = result*10 + cur%10;
cur=cur/10;
}
if(!pos)
result=(-1)*result;
if(result>INT_MAX || result<INT_MIN)
return 0;
return result;
}
相关文章推荐
- leetcode_07_Reverse Integer (easy)
- 【LeetCode-面试算法经典-Java实现】【007-Reverse Integer(翻转整数)】
- Reverse Integer leetcode python
- leetcode:Reverse Integer 及Palindrome Number
- LeetCode之“数学”:Reverse Integer && Reverse Bits
- [LeetCode 7]Reverse Integer(处理整数溢出)
- [LeetCode]:Reverse Integer(Only两类解法)
- LeetCode:Reverse Integer
- leetcode: Reverse Integer
- 007 Reverse Integer [Leetcode]
- LeetCode Reverse Integer(C)
- 4.13 leetcode -13 reverse-integer
- LeetCode Reverse Integer
- [LeetCode][7]Reverse Integer解析与位运算实现 -Java实现
- Reverse Integer [LeetCode]
- leetcode题解||Reverse Integer 问题
- leetcode Reverse Integer java基本编程学习笔记(一)
- LeetCode: Reverse Integer
- LeetCode之Reverse Integer
- 《leetcode》reverse-integer