Palindrome Number
2014-01-27 04:31
489 查看
题目：
Determine whether an integer is a palindrome. Do this without extra space.
一种是可以 reverse 整个 integer, 但会导致overflow, 更好的办法是头和尾逐个比较。
public static boolean checkPalindrome(int n) {
if (n < 0) return false;
int dev = 1;
while (n / dev >= 10) {
dev *= 10;
}
while (n > 0) {
int head = n / dev;
int tail = n % 10;
if (head != tail) return false;
n %= dev;
n /= 10;
dev /= 100;
}
return true;
}
Determine whether an integer is a palindrome. Do this without extra space.
一种是可以 reverse 整个 integer, 但会导致overflow, 更好的办法是头和尾逐个比较。
public static boolean checkPalindrome(int n) {
if (n < 0) return false;
int dev = 1;
while (n / dev >= 10) {
dev *= 10;
}
while (n > 0) {
int head = n / dev;
int tail = n % 10;
if (head != tail) return false;
n %= dev;
n /= 10;
dev /= 100;
}
return true;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode Two Sum
- leetcode Median of Two Sorted Arrays
- leetcode Longest Substring Without Repeating Characters
- leetcode Add Two Numbers
- leetcode Longest Palindromic Substring
- [LeetCode] Populating Next Right Pointers in Each Node
- [LeetCode] Populating Next Right Pointers in Each Node II
- [LeetCode] Distinct Subsequences
- [LeetCode] Flatten Binary Tree to Linked List
- [LeetCode] Path Sum
- [LeetCode] Path Sum II
- [LeetCode] Minimum Depth of Binary Tree - BFS
- [LeetCode] Minimum Depth of Binary Tree - DFS
- [LeetCode] Balanced Binary Tree
- [LeetCode] Convert Sorted List to Binary Search Tree
- [LeetCode] Convert Sorted Array to Binary Search Tree
- [LeetCode] Binary Tree Level Order Traversal II
- [LeetCode] Construct Binary Tree from Inorder and Postorder Traversal
- [LeetCode] Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode] Maximum Depth of Binary Tree