LeetCode 7. Reverse Integer
2017-06-28 17:13
357 查看
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
巧用模除逆转整数,超出32位的有符号整数反转后若溢出返回0。
class Solution {
public:
int reverse(int x) {
int ans = 0;
while (x) {
int temp = ans * 10 + x % 10;
if (temp / 10 != ans)
return 0;
ans = temp;
x /= 10;
}
return ans;
}
};
Example1: x = 123, return 321
Example2: x = -123, return -321
click to show spoilers.
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
巧用模除逆转整数,超出32位的有符号整数反转后若溢出返回0。
class Solution {
public:
int reverse(int x) {
int ans = 0;
while (x) {
int temp = ans * 10 + x % 10;
if (temp / 10 != ans)
return 0;
ans = temp;
x /= 10;
}
return ans;
}
};
相关文章推荐
- leetcode 7. Reverse Integer
- [Leetcode]7. Reverse Integer
- leetcode 7. Reverse Integer
- 蜗牛慢慢爬 LeetCode 7. Reverse Integer [Difficulty: Easy]
- LeetCode-7. Reverse Integer
- LeetCode - 7. Reverse Integer
- [LeetCode]7. Reverse Integer(自学留存)
- 【leetcode】7. Reverse Integer(Python & C++)
- [Leetcode] 7. Reverse Integer
- LeetCode-7. Reverse Integer
- Leetcode: 7. Reverse Integer
- [LeetCode]7. Reverse Integer
- Leetcode 7. Reverse Integer (Easy) (cpp)
- LeetCode 7. Reverse Integer
- LeetCode 7. Reverse Integer (倒转数字)
- LeetCode 7. Reverse Integer
- Leetcode 7. Reverse Integer(java版)
- leetcode 7. Reverse Integer
- [LeetCode - 数学] 7. Reverse Integer
- [LeetCode] 7. Reverse Integer ☆