LintCode 807: Palindrome Number II

最新推荐文章于 2022-01-02 01:12:59 发布

纸上得来终觉浅绝知此事要躬行

最新推荐文章于 2022-01-02 01:12:59 发布

阅读量142

点赞数

分类专栏： algorithm-design 文章标签： LintCode

本文链接：https://blog.csdn.net/roufoo/article/details/85894737

版权

algorithm-design 专栏收录该内容

817 篇文章 4 订阅

订阅专栏

Palindrome Number II
Determines whether a binary representation of a non-negative integer n is a palindrome

Example
Given n = 0, return True

Explanation:
The binary representation of 0 is: 0
Given n = 3, return True

Explanation:
The binary representation of 3 is: 11
Given n = 4, return False

Explanation:
The binary representation of 4 is: 100
Given n = 6, return False

Explanation:
The binary representation of 6 is: 110
Notice
0 <= n <= 2^32 - 1

代码如下：
注意：
s + 一个digit 可以用
int single_digit = 1;
s = s + static_cast(‘0’ + single_digit);
也可以用
s = s + to_string(single_digit);
前者更快。

class Solution {
public:
    /**
     * @param n: non-negative integer n.
     * @return: return whether a binary representation of a non-negative integer n is a palindrome.
     */
    bool isPalindrome(int n) {
        string s;
        while (n) {
            s = s + static_cast<char>('0' + n & 0x1);
            n >>= 1;
        }
        
        int len = s.size();
        int p1 = 0, p2 = len - 1;
        while (p1 < p2) {
            if (s[p1] != s[p2]) return false;
            p1++;
            p2--;
        }
        
        return true;
    }
};