【leetcode】Reverse Integer
2015-05-06 20:03
309 查看
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321
Example2: x = -123, return -321
思路:
这题主要注意的是范围,如果范围超出32位的限制(-214748364,2147483647),那么就得返回0。这个题目范围没有弄清楚。另外res需要设为long的形式。网上很多答案太旧,没有考虑到overflow的情况。
class Solution { public: int reverse(int x) { long res=0; int flag; if(x<0) flag=1; else flag=0; x=abs(x); while(x) { res=x%10+10*res; x=x/10; } if(res>2147483647 || res<-2147483648) return 0; if(flag==1)res=-res; return int(res); } };
相关文章推荐
- leetcode--Reverse Integer
- [LeetCode] Reverse Integer
- LeetCode Problem:Reverse Integer
- LeetCode:Reverse Integer
- LeetCode题解——Reverse Integer
- 【LeetCode】Reverse Integer
- leetcode 007 Reverse Integer
- [leetcode 7] Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode-Reverse Integer
- Leetcode: Reverse Integer
- LeetCode | 7)Reverse Integer
- leetcode--Reverse integer
- [LeetCode] Reverse Integer
- LeetCode-7:Reverse Integer
- 【Leetcode】Reverse Integer
- LEETCODE-Reverse Integer
- LeetCode | Reverse Integer
- LeetCode之7 --- Reverse Integer
- LeetCode--Reverse Integer