Leet code---Reverse Integer
2015-04-12 18:49
281 查看
#include<iostream> #include <string> using namespace std; class Solution { public: int reverse(int x) { bool sign = x > 0 ? false : true; long long temp = x; long long result = 0; temp = temp > 0 ? temp : -temp; while(temp) { result = result*10+temp % 10; temp = temp / 10; } if(result > 2147483647 || (sign && result > 2147483648)) { return 0; } else { if(sign) { return -(int)result; } else { return (int) result; } } } }; int main(){ Solution so; cout << so.reverse(153423646923) <<endl; system("pause"); }
相关文章推荐
- [leet code] Reverse Integer
- Leet Code 7 Reverse Integer
- 【Leet Code】59. Spiral Matrix II---Medium
- Leet Code 8 String to Integer - 字符串转整数 - Java
- 【Leet Code】33. Search in Rotated Sorted Array---Hard
- Leet Code 43 Multiply Strings - 字符串表示的数相乘 - Java
- 【Leet Code】55. Jump Game---Medium
- Leet Code 66 Plus One - 加一 - Java
- Leet Code 71 Simplify Path - 简化路径 - Java
- Leet Code源码 reverseWords
- 【Leet Code】String to Integer (atoi) ——常考类型题
- Leet Code 136 Single Number
- [Leet code 153, medium] Find Minimum in Rotated Sorted Array
- Compare Version Numbers (Leet Code)
- Leet Code Medium 15 3Sum
- [leet code] Same Tree
- [leet code] Remove Element
- [leet code] Roman to Integer
- [leet code] Pascal's Triangle II
- [leet code] Minimum Depth of Binary Tree