Leetcode 7. Reverse Integer
来源:互联网 发布:没文凭找工作 知乎 编辑:程序博客网 时间:2024/06/11 14:45
Example1: x = 123, return 321
Example2: x = -123, return -321
class Solution {public: int reverse(int x) { string s=to_string(x); for(int i=0,j=s.size()-1;i<j;++i,--j){ swap(s[i],s[j]); } if(x<0) return -atoi(s.c_str()); else return atoi(s.c_str()); }};
0 0
- [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
- 7. Reverse Integer LeetCode
- 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
- d3 学习资料
- PLSQL Developer连接远程oracle配置
- Eclipse Meaven Spring SpringMVC Mybaits整合
- jasperreport web项目图标不显示问题
- Intellij IDEA 的前进后退
- Leetcode 7. Reverse Integer
- ACM学习历程27——模式匹配
- HTTP 协议入门
- UIScrollView的属性总结
- LeetCode – Kth Largest Element in an Array (Java)
- GDB core 问号
- Android中Sqlite的使用及性能优化
- 根据筛法求素数,然后求最大公约数
- ThreadLocal