We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 2a515c2 commit 372a76fCopy full SHA for 372a76f
src/main/java/com/fishercoder/solutions/_693.java
@@ -31,13 +31,20 @@
31
*/
32
33
public class _693 {
34
- public boolean hasAlternatingBits(int n) {
35
- String binaryStr = Integer.toBinaryString(n);
36
- for (int i = 1; i < binaryStr.length(); i++) {
37
- if (binaryStr.charAt(i - 1) == binaryStr.charAt(i)) {
38
- return false;
+ public static class Solution1 {
+ public boolean hasAlternatingBits(int n) {
+ String binaryStr = Integer.toBinaryString(n);
+ for (int i = 1; i < binaryStr.length(); i++) {
+ if (binaryStr.charAt(i - 1) == binaryStr.charAt(i)) {
39
+ return false;
40
+ }
41
}
42
+ return true;
43
44
45
+ public static class Solution2 {
46
+ public boolean hasAlternatingBits_oneline(int n) {
47
+ return Integer.bitCount(((n >> 1) ^ n) + 1) == 1;
48
- return true;
49
50
0 commit comments