LeetCode 7
2018-03-16 16:29
176 查看
LeetCode 7
Reverse Integer
Reference：http://blog.csdn.net/booirror/article/details/43150235Problem Description：
Given a 32-bit signed integer, reverse digits of an integer.
Example 1:
Input: 123 Output: 321
Example 2:
Input: -123 Output: -321
Example 3:
Input: 120 Output: 21
Solution:
class Solution {
public:
int reverse(int x) {
int reverNum = 0;
while(x != 0) {
int n = x % 10;
x = x / 10;
if (reverNum > INT_MAX/10 || reverNum < INT_MIN/10) {
% 先对reverNum进行溢出判断，如果没有先除以10，后面*10的操作可能会溢出
return 0;
}
reverNum = reverNum*10+n;
}
return reverNum;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 17 - Letter Combinations of a Phone Number
- LeetCode232:Implement Queue using Stacks
- leetcode:3Sum Closest
- leetcode题解：Valid Palindrome（判断回文）
- <LeetCode OJ> 235. Lowest Common Ancestor of a Binary Search Tree
- leetcode 54. Spiral Matrix
- LeetCode刷题（9）
- LeetCode 8. String to Integer (atoi) （字符串到整数）
- 【LeetCode】Pascal's Triangle II 解题报告
- Leetcode 300 Longest Increasing Subsequence
- LeetCode-257.Binary Tree Paths
- 【Leetcode】【Python】【C++】1. Two Sum实现
- leetcode题解日练--2016.7.26
- LeetCode : Sort Colors
- 【leetcode】Palindrome Number
- [LeetCode][JavaScript]Ugly Number II
- leetcode Ugly Number
- LeetCode解题报告 199. Binary Tree Right Side View [medium]
- LeetCode 22. Generate Parentheses
- 【leetcode】编辑距离