LeetCode题解-9-Palindrome Number
2017-03-02 21:34
309 查看
解题思路
判断数字是否是回文数。非常简单,用rev做累计,每次取原值的最后一位累计上去,最后判断rev是否和原值相同即可。参考源码
public class Solution { public boolean isPalindrome(int x) { if (x < 0) { return false; } int tmp = x; int rev = 0; while (tmp != 0) { int k = tmp % 10; rev = rev * 10 + k; tmp = tmp / 10; } return rev == x; } }
相关文章推荐
- [LeetCode] Leetcode 题解索引 (C++/Java/Python/Sql)
- LeetCode 404. Sum of Left Leaves 题解(C++)
- LeetCode题解——Valid Parentheses
- LeetCode 242 Valid Anagram题解
- LeetCode题解:Power of Two
- LeetCode 283 Move Zeroes题解
- [81][E][leetcode 题解]Minimum Depth of Binary Tree
- LeetCode题解:Longest Consecutive Sequence
- Leetcode题解(九)
- [LeetCode]题解(python):146-LRU Cache
- Leetcode 题解系列(十六)
- LeetCode题解——Permutation总结
- leetcode题解-54. Spiral Matrix && 59. Spiral Matrix II
- LeetCode题解:Longest Substring Without Repeating Characters
- LeetCode题解--4. Median of Two Sorted Arrays
- leetcode题解日练--2016.7.1
- Leetcode题解(十一)
- leetcode题解||Reverse Integer 问题
- LeetCode题解——Happy Number
- Leetcode题解---Regular Expression Matching Java实现