LeetCode in Kotlin
693. Binary Number with Alternating Bits
Easy
Given a positive integer, check whether it has alternating bits: namely, if two adjacent bits will always have different values.
Example 1:
Input: n = 5
Output: true
Explanation: The binary representation of 5 is: 101
Example 2:
Input: n = 7
Output: false
Explanation: The binary representation of 7 is: 111.
Example 3:
Input: n = 11
Output: false
Explanation: The binary representation of 11 is: 1011.
Constraints:
1 <= n <= 231 - 1
Solution
@Suppress("NAME_SHADOWING")
class Solution {
fun hasAlternatingBits(n: Int): Boolean {
var n = n
var prev = -1
while (n != 0) {
val v = n and 1
n = n shr 1
if (prev == v) {
return false
}
prev = v
}
return true
}
}