(算法分析Week3)Reverse Integer[Easy]
来源:互联网 发布:淘宝宝贝抓取工具 编辑:程序博客网 时间:2024/06/06 00:34
7. Reverse Integer
Description
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
Note:
The input is assumed to be a 32-bit signed integer. Your function should return 0 when the reversed integer overflows.
Solution
水题。位权概念不用多说了,思路就是每次取模,留下最低位,然后循环乘10。
Complexity analysis
O(n),n为待逆序数的位数。
Code
class Solution {public: int reverse(int x) { long long result = 0; int i = 0; while(x != 0 ) { result *= 10; result += x %10; x /= 10; i++; } if (result > INT_MAX || result < INT_MIN) result = 0; //overflow return result; }};
Result
阅读全文
0 0
- (算法分析Week3)Reverse Integer[Easy]
- Leetcode算法练习-easy篇-Reverse Integer
- 算法第三周Reverse Integer[easy]
- (算法分析Week3)Merge Two Sorted Lists[Easy]
- Reverse Integer(算法分析week5)
- Reverse Integer [Easy]
- 【Leetcode】Reverse Integer(easy)
- Reverse Integer(EASY)
- 7. Reverse Integer Easy
- 2.[easy] Reverse Integer
- (算法分析Week2)Roman to Integer[Easy]
- [Leetcode 7, Easy] Reverse integer
- 【LeetCode】(7)Reverse Integer(Easy)
- 7. Reverse Integer [easy] (Python)
- Easy 7题 Reverse Integer
- 7. Reverse Integer (Easy)
- LeetCode #7 - Reverse Integer - Easy
- 算法系列--Reverse Integer
- 数据仓库
- 十分钟带你入门Java的反射机制
- No module named tensorflow
- yii2-事件
- 开始写技术博客了
- (算法分析Week3)Reverse Integer[Easy]
- HihoCoder-1586 Minimum(线段树,区间最值,ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛)
- 数据结构思维导图
- redis : 桌面管理工具 redis-desktop-manager使用指南
- 2017 ACM-ICPC北京网络赛: C. Matrix(DP)
- 解决Django下“ ModuleNotFoundError: No module named 'models' ”的错误
- 调色
- caffe下FCN测试
- jQuery-zTree插件使用