fixed bug + count div done

Author: rampatra

src/me/ramswaroop/arrays/CountDivisors.java

@@ -0,0 +1,30 @@
+package me.ramswaroop.arrays;
+
+/**
+ * Created by ramswaroop on 31/05/2016.
+ */
+public class CountDivisors {
+
+    /**
+     * Counts the number of integers in the range {@param begin} and
+     * {@param end} that are divisible by {@param n}.
+     *
+     * @param begin
+     * @param end
+     * @param n
+     * @return
+     */
+    public static int countDivisorsInRange(int begin, int end, int n) {
+        int b = end / n + 1;  // From 0 to end the integers divisible by n
+        int a = begin / n + 1;  // From 0 to begin the integers divisible by n
+
+        if (begin % n == 0) { // "begin" is inclusive; if divisible by n then
+            --a;        //   remove 1 from "a"
+        }
+        return b - a;     // return integers in range
+    }
+
+    public static void main(String[] a) {
+        countDivisorsInRange(0, 2000000000, 5);
+    }
+}

src/me/ramswaroop/bits/BinaryGap.java

@@ -18,15 +18,14 @@ public static int findBinaryGap(long n) {
         int maxGap = 0;
         while (n > 0) {
             if ((n & 1) == 1) {
-                n = n >>> 1;
-                while (n > 0 && (n & 1) == 0) {
+                while (n >>> 1 > 0 && (n >>> 1 & 1) == 0) {
                     gap++;
                     n = n >>> 1;
                 }
                 if (gap > maxGap) {
                     maxGap = gap;
-                    gap = 0;
                 }
+                gap = 0;
             }
             n = n >>> 1;
         }
@@ -45,5 +44,7 @@ public static void main(String[] args) {
         System.out.println(findBinaryGap(16));
         System.out.println(findBinaryGap(17));
         System.out.println(findMaxNoOf0sBetweenTwo1s(121));
+        System.out.println(findMaxNoOf0sBetweenTwo1s(1041));
+        System.out.println(findMaxNoOf0sBetweenTwo1s(2_147_483_64889L));
     }
 }