lintry

add #9

1 +/**
2 + * @param {number} x
3 + * @return {boolean}
4 + */
5 +var isPalindrome = function(x) {
6 + if (x < 0 || (!!x && x % 10 === 0)) {
7 + return false;
8 + }
9 +
10 + let reverseNum = 0;
11 + while (x > reverseNum) {
12 + reverseNum = reverseNum * 10 + x % 10;
13 + x = ~~(x/10);
14 + }
15 + // console.info(x, reverseNum);
16 + return x === reverseNum || x === ~~(reverseNum/10);
17 +};
18 +
19 +let nums = [0, 10, 121, 1001, 10001, 12021, 12212];
20 +nums.forEach(n => {
21 + console.info(n, isPalindrome(n));
22 +});
...@@ -12,7 +12,7 @@ leetcode-cn.com上的题库代码实现 ...@@ -12,7 +12,7 @@ leetcode-cn.com上的题库代码实现
12 | | 6 | [Z 字形变换](https://leetcode-cn.com/problems/zigzag-conversion) | **中等** | 12 | | 6 | [Z 字形变换](https://leetcode-cn.com/problems/zigzag-conversion) | **中等** |
13 | 7-reverse.js | 7 | [整数反转](https://leetcode-cn.com/problems/reverse-integer) | **简单** | 13 | 7-reverse.js | 7 | [整数反转](https://leetcode-cn.com/problems/reverse-integer) | **简单** |
14 | | 8 | [字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi) | **中等** | 14 | | 8 | [字符串转换整数 (atoi)](https://leetcode-cn.com/problems/string-to-integer-atoi) | **中等** |
15 -| | 9 | [回文数](https://leetcode-cn.com/problems/palindrome-number) | **简单** | 15 +| 9-isPalindrome.js | 9 | [回文数](https://leetcode-cn.com/problems/palindrome-number) | **简单** |
16 | | 10 | [正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching) | **困难** | 16 | | 10 | [正则表达式匹配](https://leetcode-cn.com/problems/regular-expression-matching) | **困难** |
17 | | 11 | [盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water) | **中等** | 17 | | 11 | [盛最多水的容器](https://leetcode-cn.com/problems/container-with-most-water) | **中等** |
18 | | 12 | [整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman) | **中等** | 18 | | 12 | [整数转罗马数字](https://leetcode-cn.com/problems/integer-to-roman) | **中等** |
......