@@ -0,0 +1,329 @@
+package leetcode.bitwise_and_of_numbers_range;%0A%0Apublic class Solution %7B%0A    public int rangeBitwiseAnd(int m, int n) %7B%0A        int ans = 0;%0A        for(int i = 0; i %3C 31; i++)%7B%0A            if((m & ~((1 %3C%3C i) - 1)) == (n & ~((1 %3C%3C i) - 1)))%7B%0A                ans %7C= (1 %3C%3C i) & m;%0A            %7D%0A        %7D%0A        return ans;%0A    %7D%0A%7D

Add java solution for 201. Bitwise AND of Numbers Range