LeetCode: Reverse Integer
2015-04-11 11:01
288 查看
Title :
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
主要注意的问题是防止数组越界的问题。还有通过除法、取模计算的要记住
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
主要注意的问题是防止数组越界的问题。还有通过除法、取模计算的要记住
class Solution { public: int reverse(int x) { long long result = 0; while(x != 0){ result = result * 10 + x % 10; if (result < INT_MIN || result > INT_MAX ) return 0; x = x / 10; } return result; } };
相关文章推荐
- [LeetCode] Reverse Integer 翻转整数
- [LeetCode] Reverse Integer 解题报告
- LeetCode Reverse Integer
- leetcode: Reverse Integer 菜鸟解法
- LeetCode 7 Reverse Integer(反转数字)
- [LeetCode] Number of 1 Bits & Reverse Integer - 整数问题系列
- LeetCode OJ Reverse Integer
- leetcode第7题——*Reverse Integer
- 【LeetCode】Reverse Integer解题笔记
- LeetCode Reverse Integer
- leetcode7. Reverse Integer:Given a 32-bit signed integer, reverse digits of an integer.
- LeetCode Reverse Integer
- Leetcode|Reverse Integer(string转char*总结)
- 【python】【leetcode】【算法题目7—Reverse Integer】
- LeetCode——Reverse Integer
- LeetCode刷题(C++)——Reverse Integer(Easy)
- leetcode题目: Reverse Integer 的C语言解法
- LeetCode 7&9 Reverse Integer & Palindrome Number
- Leetcode:Reverse Integer
- LeetCode Reverse Integer