Merge pull request doocs#269 from J-Cod3r/master

feat:add insert into bits,convert integer,exchange java solution

Author: yanglbme

lcci/05.01.Insert Into Bits/README.md

@@ -34,7 +34,14 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int insertBits(int N, int M, int i, int j) {
+        for (int k = i; k <= j; k++) {
+            N &= ~(1 << k);
+        }
+        return N ^ (M << i);
+    }
+}
 ```
 
 ### ...

lcci/05.01.Insert Into Bits/README_EN.md

@@ -31,7 +31,14 @@
 ### Java
 
 ```java
-
+class Solution {
+    public int insertBits(int N, int M, int i, int j) {
+        for (int k = i; k <= j; k++) {
+            N &= ~(1 << k);
+        }
+        return N ^ (M << i);
+    }
+}
 ```
 
 ### ...

lcci/05.01.Insert Into Bits/Solution.java

@@ -0,0 +1,8 @@
+class Solution {
+    public int insertBits(int N, int M, int i, int j) {
+        for (int k = i; k <= j; k++) {
+            N &= ~(1 << k);
+        }
+        return N ^ (M << i);
+    }
+}

lcci/05.06.Convert Integer/README.md

@@ -40,7 +40,11 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int convertInteger(int A, int B) {
+        return Integer.bitCount(A ^ B);
+    }
+}
 ```
 
 ### ...

lcci/05.06.Convert Integer/README_EN.md

@@ -56,7 +56,11 @@
 ### Java
 
 ```java
-
+class Solution {
+    public int convertInteger(int A, int B) {
+        return Integer.bitCount(A ^ B);
+    }
+}
 ```
 
 ### ...

lcci/05.06.Convert Integer/Solution.java

@@ -0,0 +1,5 @@
+class Solution {
+    public int convertInteger(int A, int B) {
+        return Integer.bitCount(A ^ B);
+    }
+}

lcci/05.07.Exchange/README.md

@@ -40,7 +40,13 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int exchangeBits(int num) {
+        int t1 = num >> 1;
+    	int t2 = num << 1;
+    	return t1 & 0x55555555 | t2 & 0xaaaaaaaa;
+    }
+}
 ```
 
 ### ...

lcci/05.07.Exchange/README_EN.md

@@ -57,7 +57,13 @@
 ### Java
 
 ```java
-
+class Solution {
+    public int exchangeBits(int num) {
+        int t1 = num >> 1;
+    	int t2 = num << 1;
+    	return t1 & 0x55555555 | t2 & 0xaaaaaaaa;
+    }
+}
 ```
 
 ### ...

lcci/05.07.Exchange/Solution.java

@@ -0,0 +1,7 @@
+class Solution {
+    public int exchangeBits(int num) {
+        int t1 = num >> 1;
+    	int t2 = num << 1;
+    	return t1 & 0x55555555 | t2 & 0xaaaaaaaa;
+    }
+}