[LeetCode] 693. Binary Number with Alternating Bits (C++)

最新推荐文章于 2025-05-01 07:15:00 发布

原创最新推荐文章于 2025-05-01 07:15:00 发布 · 160 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

OnlineJuge

当前文章被收录于：

OnlineJuge

16 篇文章 0 人学习

订阅专栏查看详情

当前文章被以下社区和专栏收录：

本文介绍了一种算法，用于检查一个正整数的二进制表示中，位是否交替出现，即相邻位的值是否总是不同。通过几个示例说明了算法的工作原理和预期输出。

Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.

Example 1:

Input: 5
Output: True
Explanation:
The binary representation of 5 is: 101

Example 2:

Input: 7
Output: False
Explanation:
The binary representation of 7 is: 111.

Example 3:

Input: 11
Output: False
Explanation:
The binary representation of 11 is: 1011.

Example 4:

Input: 10
Output: True
Explanation:
The binary representation of 10 is: 1010.

class Solution {
public:
    bool hasAlternatingBits(int n) {
        int former = n % 2;
        int now = 0;
        while (n != 0) {
            n = n / 2;
            if (n % 2 == former)
                return false;
            former = n % 2;
        }
        return true;
    }
};

标签

#LeetCode