LeetCode | Reverse Integer
来源:互联网 发布:淘宝怎么发照片给卖家 编辑:程序博客网 时间:2024/05/17 07:25
题目:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
思路
题目计较简单,直接上代码吧!代码:
class Solution {public: int reverse(int x) { // Start typing your C/C++ solution below // DO NOT write int main() function bool reverse = false; if(x < 0) { reverse = true; x = -x; } int result = 0; while(x > 0) { int temp = x % 10; if(INT_MAX / 10 < result){ return 0; } else if(INT_MAX / 10 == result && INT_MAX % 10 < temp){ return 0; } result *= 10; result += temp; x /= 10; } if(reverse) { return -result; } else return result; }};
- 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: Reverse Integer
- 大数据核心技术源码分析之-Avro篇
- poj1207
- floodfill算法
- Oracle用户管理
- 八、cocos2dx之TileMap
- LeetCode | Reverse Integer
- 时间管理之“四象限”法
- Google 2014校招测试赛 Problem B
- 数据结构之链表
- 为一本教材作序《信息安全:原理与实践》
- CXF WebShere 冲突问题
- django学习(一)
- Oracle学习方法
- jquery实例练习(二)