LeetCode OJ 9 Palindrome Number
来源:互联网 发布:用友软件操作 编辑:程序博客网 时间:2024/06/11 09:39
题目:
Determine whether an integer is a palindrome. Do this without extra space.
难度
easy
思路:每一个提取最高位和最低位进行比较即可
代码如下
using namespace std;class Solution {public: bool isPalindrome(int x) { if(x<0) return false; if(x<10) return true; int d=1;//divisor while(x/d>=10) d*=10;//calculate the quantitatively of x while(x>0){ int r=x%10; int l=x/d; if(r!=l) return false; x=x%d/10; d/=100; } return true; }};
0 0
- LeetCode OJ 9 Palindrome Number
- LeetCode OJ:Palindrome Number
- LeetCode OJ - Palindrome Number
- LeetCode OJ Palindrome Number
- LeetCode OJ - Palindrome Number
- LeetCode OJ 9 Palindrome Number [easy]
- [LeetCode OJ][009]Palindrome Number
- 【LeetCode OJ 009】Palindrome Number
- <LeetCode OJ> 9. Palindrome Number
- LeetCode OJ 9. Palindrome Number
- Leetcode OJ: 9. Palindrome Number
- LeetCode OJ: 9. Palindrome Number (C++)
- LeetCode 9 - Palindrome Number
- leetcode 9 Palindrome Number
- Leetcode【9】:Palindrome Number
- [leetcode 9] Palindrome Number
- [Leetcode] 9 - Palindrome Number
- LeetCode(9) Palindrome Number
- 解决编译apache出现的问题:configure: error: APR not found . Please read the documentation
- 感兴趣的一个小问题
- android 内存泄漏之Context--整理-引用
- eclipse 配置 maven
- IO流(需要注意的问题)
- LeetCode OJ 9 Palindrome Number
- String,StringBuffer与StringBuilder的区别??
- html总结1
- (1)python基本使用
- CCI 复习笔记 3
- 硬盘安装Ubuntu
- aoj2450 Do use segment tree 树链剖分
- 连续下滑即使是华润雪花等
- poj 3693(后缀数组)