A binary gap within a positive integer N is any maximal sequence of consecutive zeros that is surrounded by ones at both ends in the binary representation of N.

For example, number 9 has binary representation 1001 and contains a binary gap of length 2. The number 529 has binary representation 1000010001 and contains two binary gaps: one of length 4 and one of length 3. The number 20 has binary representation 10100 and contains one binary gap of length 1. The number 15 has binary representation 1111 and has no binary gaps.

Write a function:

class Solution { public int solution(int N); }

that, given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn't contain a binary gap.

For example, given N = 1041 the function should return 5, because N has binary representation 10000010001 and so its longest binary gap is of length 5.

---------------- Solution

1- For getting the binary code of number using java you can use:
2- Using regex pattern 
you can get all instances between 1s so you can check length of all of them to get the largest one.

The implementation is as below:

import java.util.regex.Matcher;
import java.util.regex.Pattern;

public class Solution {
    public static int solution(int N) {
        int max = 0;
        String x= Integer.toBinaryString(N);
        Matcher m = Pattern.compile("(?<=1)(.*?)(?=1)").matcher(x);
        while(m.find()) {
            if( > max)
                max =;
        return max;

ليست هناك تعليقات:

إرسال تعليق

---- أتشرف بتعليقاتكم ----