9. Palindrome Number
2016-11-05 23:14
267 查看
Determine whether an integer is a palindrome. Do this without extra space.
思路:就是用 "Reverse Integer" 的解法來判斷就行了
class Solution {
public:
bool isPalindrome(int x) {
if( x < 0) return false;
return x == reverse(x);
}
int reverse(int x) {
long newNum = 0;
long tmp = 0;
while(x != 0) {
tmp = newNum*10;
newNum = (long)( tmp + x%10);
if(newNum != (int)(tmp + x%10)) {
return 0;
}
x = x/10;
}
return (int)newNum;
}
};
思路:就是用 "Reverse Integer" 的解法來判斷就行了
class Solution {
public:
bool isPalindrome(int x) {
if( x < 0) return false;
return x == reverse(x);
}
int reverse(int x) {
long newNum = 0;
long tmp = 0;
while(x != 0) {
tmp = newNum*10;
newNum = (long)( tmp + x%10);
if(newNum != (int)(tmp + x%10)) {
return 0;
}
x = x/10;
}
return (int)newNum;
}
};
相关文章推荐
- leetcode Palindrome Number
- Palindrome_Number
- 9. Palindrome Number
- Leetcode第9题Palindrome Number
- leetcode Reverse Integer & Palindrome Number
- leetcode Palindrome Number
- leetcode Palindrome Number (判断整数是否为回文)
- Leetcode Palindrome Number
- LeetCode -- palindrome_number问题
- 9. Palindrome Number
- 9. Palindrome Number
- 9.Palindrome Number
- Palindrome Number
- 蓝桥杯基础-012-Palindrome_Number
- Palindrome Number --回文整数
- Palindrome Number java leetcode(leetcode 回形数 java版本)
- Palindrome Number
- 9. Palindrome Number
- 9. Palindrome Number
- leetcode之Palindrome Number