#Leetcode# 9. Palindrome Number
Posted 丧心病狂工科女
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了#Leetcode# 9. Palindrome Number相关的知识,希望对你有一定的参考价值。
https://leetcode.com/problems/palindrome-number/description/
Determine whether an integer is a palindrome. An integer is a palindrome when it reads the same backward as forward.
Example 1:
Input: 121 Output: true
Example 2:
Input: -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome.
Example 3:
Input: 10 Output: false Explanation: Reads 01 from right to left. Therefore it is not a palindrome.
代码:
class Solution { public: bool isPalindrome(int x) { if(x < 0) return false; else { int ans = x; int num = 0; while(x > 0) { num = num * 10 + x % 10; x /= 10; } if(num == ans) return true; } return false; } };
以上是关于#Leetcode# 9. Palindrome Number的主要内容,如果未能解决你的问题,请参考以下文章