leetcode 7:Reverse Integer(知识点:vector ,复习STL stack,queue)
来源:互联网 发布:贝克街的亡灵 知乎 编辑:程序博客网 时间:2024/06/05 10:06
题目:
Reverse digits of an integer.
Example1: x = 123, return 321
Example2: x = -123, return -321
解答:
这道题很简单,但是很坑,测试数据产生的结果如果溢出的话,应该返回0,但是并没有在题目中写到。
测试int类型是否溢出的方法:用long long类型完全一样地做一遍,最后比较两者结果是否相同。
#include <vector>#include <cmath>class Solution {public: int reverse(int x) { vector<int> a; int sign = x >= 0 ? 1 : -1; int absOfX = abs(x); while(absOfX){ int num = absOfX % 10; absOfX /= 10; a.push_back(num); } int result1 = 0; long long result2 = 0; int index = 1; while(!a.empty()){ int add = a.back() * index; long long addL = (long long)a.back() * index; if(add != addL){ return 0; } result1 += add; result2 += addL; index *= 10; a.pop_back(); } result1 *= sign; result2 *= sign; if(result1 != result2) return 0; else return result1 ; }};
知识点:
STL vector :http://blog.csdn.net/phoebin/article/details/3864590
STL stack,queue:
http://www.cnblogs.com/mfryf/archive/2012/08/09/2629992.html
0 0
- leetcode 7:Reverse Integer(知识点:vector ,复习STL stack,queue)
- LeetCode Summary STL Stack Queue
- Leetcode - vector\stack - Evaluate Reverse Polish Notation
- LeetCode 7 - Reverse Integer
- LeetCode(7) Reverse Integer
- leetcode 7REVERSE INTEGER
- [leetcode 7] Reverse Integer
- [Leetcode] 7 - Reverse Integer
- LeetCode 7:《Reverse Integer》
- [leetcode 7] Reverse Integer
- LeetCode | #7 Reverse Integer
- leetcode.7-----------Reverse Integer
- LeetCode 7: Reverse Integer
- leetcode-7 Reverse Integer
- leetcode(7)Reverse Integer
- LeetCode 7 - Reverse Integer
- leetcode 7 Reverse Integer
- leetcode #7 Reverse Integer
- CAP理论
- 【Cherry云计算】云计算概述
- 如何安装Sublime Text 3汉化插件
- mysql 5.7 To log in you must change it using a client that supports expired passwords
- Cookie技术
- leetcode 7:Reverse Integer(知识点:vector ,复习STL stack,queue)
- 如何将Eclipse中Web项目打成war包
- 网上前端资源总结
- APK反编译
- HDU 1231最大连续子序列
- C# yield return 和 yield break
- 使用phonegap定时获取位置信息
- Java基本类型(传值)复合类型(引用)
- PAT 1046Sharing (25)(不同长度字符串交点)