- LeetCode从零刷起 (9. Palindrome Numb
- Leetcode PHP题解--D133 9. Palindro
- leetcode:9. Palindrome Number
- [leetcode] 9. Palindrome Number
- [LeetCode] 9. Palindrome Number
- [LeetCode] 9. Palindrome Number
- LeetCode 9. Palindrome Number
- LeetCode #9. Palindrome Number
- Leetcode 9. Palindrome Number
- [Leetcode] 9. Palindrome Number
回文数字
首先 负数 ‘-x’ 肯定不是 palindrome
这题就是用 数字反转
e.g. 123 --> 321
ans = ans*10 + x%10
| ans | x |
|---|---|
| 0*10 + 123%10 = 3 | 123/10 = 12 |
| 3*10 + 12%10 = 32 | 12/10 = 1 |
| 32*10 + 1%10 = 321 | 1/10 = 0 |
class Solution {
public:
bool isPalindrome(int x) {
if(x < 0) return 0;
int origin = x;
int ans = 0;
while(x){
ans = ans*10 + x%10;
x = x/10;
}
return origin==ans;
}
};
image.png
当然 可以用python赖皮 ........(逃
class Solution:
def isPalindrome(self, x):
"""
:type x: int
:rtype: bool
"""
return str(x) ==str(x)[::-1]
网友评论