g0801_0900.s0868_binary_gap.Solution Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.35

package g0801_0900.s0868_binary_gap;

// #Easy #Bit_Manipulation #2022_05_16_Time_1_ms_(82.94%)_Space_41.4_MB_(28.50%)

public class Solution {
    public int binaryGap(int n) {
        int max = 0;
        int pos = 0;
        int lastPos = -1;
        while (n != 0) {
            pos++;
            if ((n & 1) == 1) {
                if (lastPos != -1) {
                    max = Math.max(max, pos - lastPos);
                }
                lastPos = pos;
            }
            n >>= 1;
        }
        return max;
    }
}