-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path693.交替位二进制数.go
68 lines (67 loc) · 1.02 KB
/
693.交替位二进制数.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*
* @lc app=leetcode.cn id=693 lang=golang
*
* [693] 交替位二进制数
*
* https://leetcode-cn.com/problems/binary-number-with-alternating-bits/description/
*
* algorithms
* Easy (59.32%)
* Likes: 30
* Dislikes: 0
* Total Accepted: 6K
* Total Submissions: 10K
* Testcase Example: '5'
*
* 给定一个正整数,检查他是否为交替位二进制数:换句话说,就是他的二进制数相邻的两个位数永不相等。
*
* 示例 1:
*
*
* 输入: 5
* 输出: True
* 解释:
* 5的二进制数是: 101
*
*
* 示例 2:
*
*
* 输入: 7
* 输出: False
* 解释:
* 7的二进制数是: 111
*
*
* 示例 3:
*
*
* 输入: 11
* 输出: False
* 解释:
* 11的二进制数是: 1011
*
*
* 示例 4:
*
*
* 输入: 10
* 输出: True
* 解释:
* 10的二进制数是: 1010
*
*
*/
func hasAlternatingBits(n int) bool {
lastValue := -1
mask := 0x01
for n > 0 {
if n&mask == lastValue {
return false
} else {
lastValue = n & mask
}
n = n >> 1
}
return true
}