LeetCode 7: Reverse Integer
2015-10-18 23:13
232 查看
Reverse Integer
Reverse digits of an integer.Example1: x = 123, return 321
Example2: x = -123, return -321
解题思路
本题比较简单,但是需要注意结果可能溢出。假设输入是一个 32-bit 的整数,则1000000003的reverse结果会溢出。class Solution { public: int reverse(int x) { // INT_MIN 和 INT_MAX 定义在 <limits> 头文件中 if (x == INT_MIN) return 0; //// reverse 溢出 bool isNeg = false; if (x < 0) { isNeg = true; x = -x; } long long result = 0; while (x) { result = result * 10 + x % 10; x = x / 10; } if (result > INT_MAX) return 0; // reverse 溢出 return isNeg ? -result : result; } };
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists(合并两个排好序的单链表);leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解
- LeetCode [Day 5] Longest Palindromic Substring 题解