Open carloscn opened 1 year ago
static bool has_alternating_bits(int32_t n)
{
bool ret = false;
bool current_bit_status = false, last_bit_status = false;
last_bit_status = n & 0x1;
while (n) {
n >>= 1;
current_bit_status = n & 0x1;
if (current_bit_status == last_bit_status) {
return false;
}
last_bit_status = current_bit_status;
}
return true;
}
fn has_alternating_bits(n:i32) -> bool
{
let mut last_bit_status:i32 = 0;
let mut current_bit_status:i32 = 0;
let mut e:i32 = n;
last_bit_status = e & 0x1_i32;
while e != 0 {
e >>= 1;
current_bit_status = e & 0x1_i32;
if current_bit_status == last_bit_status {
return false;
}
last_bit_status = current_bit_status;
}
return true;
}
问题描述
给定一个正整数,检查它的二进制表示是否总是 0、1 交替出现:换句话说,就是二进制表示中相邻两位的数字永不相同。
示例 1:
输入:n = 5 输出:true 解释:5 的二进制表示是:101 示例 2:
输入:n = 7 输出:false 解释:7 的二进制表示是:111. 示例 3:
输入:n = 11 输出:false 解释:11 的二进制表示是:1011.
提示:
1 <= n <= 231 - 1
来源:力扣(LeetCode) 链接:https://leetcode.cn/problems/binary-number-with-alternating-bits