9. Palindrome Number
来源:互联网 发布:数据中心网络拓扑图 编辑:程序博客网 时间:2024/05/18 17:24
Determine whether an integer is a palindrome. Do this without extra space.
没啥好说,判断一个数字是否为回文数字。
class Solution {public: bool isPalindrome(int x) { int newx = 0; int xx = x; while(xx > 0) { newx = newx * 10; newx = newx + xx % 10; xx = xx / 10; } if(newx == x) return 1; else return 0; }};
0 0
- LeetCode 9. Palindrome Number
- [LeetCode]9.Palindrome Number
- LeetCode --- 9. Palindrome Number
- LeetCode 9.Palindrome Number
- [Leetcode] 9. Palindrome Number
- 9.Palindrome Number
- 9. Palindrome Number
- 9. Palindrome Number
- Problem 9.Palindrome Number
- 【leetcode】 9. palindrome number
- 9.Palindrome Number
- [LeetCode] 9.Palindrome Number
- 9. Palindrome Number
- LeetCode : 9. Palindrome Number
- 9. Palindrome Number
- LeetCode 9.Palindrome Number
- 9. Palindrome Number
- 9. Palindrome Number
- UVA 10790-How Many Points of Intersection?#
- WebSphere MQ 入门指南
- Pykd——Python extension for WinDbg
- nginx.conf详解
- @PathVariable和@RequestParam的区别,理解 @PathVariable 、@RequestHeader、@CookieValue、@RequestParam, @Request
- 9. Palindrome Number
- leetcode:word-break
- ReactNative Demo - Navigator 使用
- mongoDB 入门指南、示例
- 2016/07/20 对闭包、构造函数的理解
- 内存泄漏之内部类new Handler();
- UVA 846-Steps
- ReactNative Demo -SearchInput
- 社会化三方分享集成详细介绍(友盟)