We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Difficulty: 简单
Related Topics: 数学
给你一个整数 x ,如果 x 是一个回文整数,返回 true ;否则,返回 false 。
x
true
false
回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。
121
123
示例 1:
输入:x = 121 输出:true
示例 2:
输入:x = -121 输出:false 解释:从左向右读, 为 -121 。 从右向左读, 为 121- 。因此它不是一个回文数。
示例 3:
输入:x = 10 输出:false 解释:从右向左读, 为 01 。因此它不是一个回文数。
提示:
**进阶:**你能不将整数转为字符串来解决这个问题吗?
Language: JavaScript
/** * @param {number} x * @return {boolean} */ var isPalindrome = function(x) { return +x.toString().split('').reverse().join('') === x; };
The text was updated successfully, but these errors were encountered:
No branches or pull requests
9. 回文数
Description
Difficulty: 简单
Related Topics: 数学
给你一个整数
x
,如果x
是一个回文整数,返回true
;否则,返回false
。回文数是指正序(从左向右)和倒序(从右向左)读都是一样的整数。
121
是回文,而123
不是。示例 1:
示例 2:
示例 3:
提示:
**进阶:**你能不将整数转为字符串来解决这个问题吗?
Solution
Language: JavaScript
The text was updated successfully, but these errors were encountered: