-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBinaryGap.java
More file actions
38 lines (28 loc) · 957 Bytes
/
Copy pathBinaryGap.java
File metadata and controls
38 lines (28 loc) · 957 Bytes
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
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class BinaryGap {
public static void main(String[] args) {
String binary = Integer.toBinaryString(15);
char[] binaryArr = binary.toCharArray();
List<Integer> gaps = new ArrayList<>();
int count = 0;
for(int i = 0; i < binaryArr.length; i++) {
if(i+1 < binaryArr.length) {
if(binaryArr[i] == '1' && binaryArr[i+1] == '0') {
count++;
}
if(binaryArr[i] == '0' && binaryArr[i+1] == '0') {
count++;
}
if(binaryArr[i] == '0' && binaryArr[i+1] == '1') {
gaps.add(count);
count = 0;
}
}
}
System.out.println(gaps.stream().max(Integer::compare).orElse(0));
}
}