[LeetCode] 087: Reverse Integer
来源:互联网 发布:怎么上淘宝的每日好店 编辑:程序博客网 时间:2024/06/08 19:43
[Problem]
[Solution]
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Have you thought about this?
Here are some good questions to ask before coding. Bonus points for you if you have already thought through this!
If the integer's last digit is 0, what should the output be? ie, cases such as 10, 100.
Did you notice that the reversed integer might overflow? Assume the input is a 32-bit integer, then the reverse of 1000000003 overflows. How should you handle such cases?
Throw an exception? Good, but what if throwing an exception is not an option? You would then have to re-design the function (ie, add an extra parameter).
[Solution]
class Solution {说明:版权所有,转载请注明出处。Coder007的博客
public:
int reverse(int x) {
// Note: The Solution object is instantiated only once and is reused by each test case.
long long y = 0;
bool mark = x < 0 ? true, x = -1*x : false;
while(x > 0){
y = y*10 + x%10;
x /= 10;
}
return mark ? -y : y;
}
};
阅读全文
0 0
- [LeetCode] 087: Reverse Integer
- LeetCode:Reverse Integer
- LeetCode: Reverse Integer
- [Leetcode] Reverse Integer
- LeetCode : Reverse Integer
- [LeetCode] Reverse Integer
- Leetcode: Reverse Integer
- LeetCode 7 - Reverse Integer
- leetcode 104: Reverse Integer
- Leetcode : Reverse Integer
- 【leetcode】Reverse Integer
- [LeetCode]Reverse Integer
- LeetCode-Reverse Integer
- [leetcode] Reverse Integer
- LeetCode - Reverse Integer
- leetcode之Reverse Integer
- LeetCode | Reverse Integer
- LeetCode: Reverse Integer
- [LeetCode] 084: Remove Element
- [LeetCode] 085: Remove Nth Node From End of List
- 幂指函数求导公式——备忘
- [LeetCode] 086: Restore IP Addresses
- Oracle 11g Data Guard搭建物理Standby数据库(一)
- [LeetCode] 087: Reverse Integer
- [LeetCode] 088: Reverse Linked List II
- 排序算法学习笔记
- [LeetCode] 089: Reverse Noes in k-Group
- [LeetCode] 090: Roman to Integer
- [LeetCode] 091: Rotate Image
- [LeetCode] 092: Rotate List
- 国外物联网平台初探(二) ——微软Azure IoT
- [LeetCode] 093: Same Tree