Sure, here is a Java solution for the problem:

```java
class Solution {
public int solution(int N) {
String binaryString = Integer.toBinaryString(N);
int maxGap = 0;
int currentGap = 0;
for (char c : binaryString.toCharArray()) {
if (c == '0') {
currentGap++;
} else {
if (currentGap maxGap) {
maxGap = currentGap;
}
currentGap = 0;
}
}
return maxGap;
}
}
```

This function works as follows:

1. It converts the integer `N` to a binary string.
2. It initializes two variables, `maxGap` and `currentGap`, to keep track of the longest binary gap and the current binary gap, respectively.
3. It iterates over each character in the binary string. If the character is '0', it increments `currentGap`. If the character is '1', it checks if `currentGap` is greater than `maxGap`, and if so, it updates `maxGap` with the value of `currentGap`. It then resets `currentGap` to 0.
4. After the loop, it returns `maxGap`, which is the length of the longest binary gap.

Question

Sure, here is a Java solution for the problem:

```java
class Solution {
    public int solution(int N) {
        String binaryString = Integer.toBinaryString(N);
        int maxGap = 0;
        int currentGap = 0;
        for (char c : binaryString.toCharArray()) {
            if (c == '0') {
                currentGap++;
            } else {
                if (currentGap > maxGap) {
                    maxGap = currentGap;
                }
                currentGap = 0;
            }
        }
        return maxGap;
    }
}
```

This function works as follows:

1. It converts the integer `N` to a binary string.
2. It initializes two variables, `maxGap` and `currentGap`, to keep track of the longest binary gap and the current binary gap, respectively.
3. It iterates over each character in the binary string. If the character is '0', it increments `currentGap`. If the character is '1', it checks if `currentGap` is greater than `maxGap`, and if so, it updates `maxGap` with the value of `currentGap`. It then resets `currentGap` to 0.
4. After the loop, it returns `maxGap`, which is the length of the longest binary gap.

Knowee AI · Accepted Answer

Sure, here is a Java solution for the problem:

```java
class Solution {
    public int solution(int N) {
        String binaryString = Integer.toBinaryString(N);
        int maxGap = 0;
        int currentGap = 0;
        for (char c : binaryString.toCharArray()) {
            if (c == '0') {
                currentGap++;
            } else {
                if (currentGap > maxGap) {
                    maxGap = currentGap;
                }
                currentGap = 0;
            }
        }
        return maxGap;
    }
}
```

This function works as follows:

1. It converts the integer `N` to a binary string.
2. It initializes two variables, `maxGap` and `currentGap`, to keep track of the longest binary gap and the current binary gap, respectively.
3. It iterates over each character in the binary string. If the character is '0', it increments `currentGap`. If the character is '1', it checks if `currentGap` is greater than `maxGap`, and if so, it updates `maxGap` with the value of `currentGap`. It then resets `currentGap` to 0.
4. After the loop, it returns `maxGap`, which is the length of the longest binary gap.

Question

Solution

Similar Questions

Upgrade your grade with Knowee