LeetCode-693. Binary Number with Alternating Bits

最新推荐文章于 2021-03-31 10:29:13 发布

原创最新推荐文章于 2021-03-31 10:29:13 发布 · 535 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#java #leetcode

LeetCode题解同时被 2 个专栏收录

60 篇文章

订阅专栏

LeetCode

59 篇文章

订阅专栏

本文介绍了一个算法问题，即如何判断一个正整数的二进制表示中相邻位是否交替出现0和1。通过四个具体示例说明了该问题的解决方案，并给出了一段Java代码实现。

693. Binary Number with Alternating Bits

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 boolean hasAlternatingBits(int n) {
        int count = 0;
        String str = Integer.toBinaryString(n);
        for (int i = 0; i < str.length()-1; i++) {
            if(str.charAt(i)==str.charAt(i+1)) count++; 
        }
        if(count == 0) return true;
        else return false;
    }
}