增加部分注释

Author: JavaScalaDeveloper

huawei/src/main/java/Main.java renamed to huawei/src/main/java/HuaWei.java

@@ -1,6 +1,6 @@
 package main.java;
 
-public class Main {
+public class HuaWei {
     /**
      * 给你一个字符串 s 和一个字符 c ，且 c 是 s 中出现过的字符。
      * 返回一个整数数组 answer ，其中 answer.length == s.length 且 answer[i] 是 s 中从下标 i 到离它 最近 的字符 c 的 距离 。

leetcode/lcci/05.01.Insert Into Bits/README.md

@@ -50,10 +50,30 @@ class Solution {
 }
 ```
 
-### **...**
+### **分享我的解题思路**
 
-```
+```java
+public class Main {
+    public static void main(String[] args) {
+        //int N = 0b10000000000, M = 0b10011, i = 2, j = 6;
+        int N = 0b0, M = 0b11111, i = 0, j = 4;
+        int res = insertBits(N, M, i, j);
+        System.out.println(Integer.toBinaryString(res));
+        System.out.println(Integer.toBinaryString(N ^ (M << i)));
+    }
+
+    public static int insertBits(int N, int M, int i, int j) {
+        for (int k = i; k <= j; k++) {
+            N &= ~(1 << k);
+        }
+        return N ^ (M << i);
+    }
 
+    //解法二
+    public static int insertBits2(int N, int M, int i, int j) {
+        return N ^ (M << i);
+    }
+}
 ```
 
 <!-- tabs:end -->

leetcode/lcci/05.07.Exchange/README.md

@@ -49,8 +49,10 @@
 class Solution {
     public int exchangeBits(int num) {
         int t1 = num >> 1;
-    	int t2 = num << 1;
-    	return t1 & 0x55555555 | t2 & 0xaaaaaaaa;
+        int t2 = num << 1;
+        //0xaaaaaaaa = 10101010101010101010101010101010 (偶数位为1，奇数位为0）
+        //0x55555555 = 1010101010101010101010101010101 (偶数位为0，奇数位为1）
+        return t1 & 0x55555555 | t2 & 0xaaaaaaaa;
     }
 }
 ```

leetcode/lcci/16.01.Swap Numbers/README.md

@@ -40,10 +40,11 @@ class Solution:
 
 ```java
 class Solution {
-    public int[] swapNumbers(int[] numbers) {
-        numbers[0] = numbers[0] ^ numbers[1];
-        numbers[1] = numbers[0] ^ numbers[1];
-        numbers[0] = numbers[0] ^ numbers[1];
+    public static int[] swapNumbers(int[] numbers) {
+        //int[] numbers = {1, 2};
+        numbers[0] = numbers[0] ^ numbers[1];//11
+        numbers[1] = numbers[0] ^ numbers[1];//1
+        numbers[0] = numbers[0] ^ numbers[1];//10
         return numbers;
     }
 }

leetcode/lcci/16.11.Diving Board/README.md

@@ -39,7 +39,21 @@ k = 3
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public int[] divingBoard(int shorter, int longer, int k) {
+        if (k == 0) {
+            return new int[0];
+        }
+        if (longer == shorter) {
+            return new int[]{longer * k};
+        }
+        int[] ans = new int[k + 1];
+        for (int i = 0;i <= k;i++) {
+            ans[i] = longer * i + shorter * (k - i);
+        }
+        return ans;
+    }
+}
 ```
 
 ### **...**

leetcode/lcci/17.13.Re-Space/README.md

@@ -47,7 +47,27 @@ sentence = "jesslookedjustliketimherbrother"
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+class Solution {
+    public int respace(String[] dictionary, String sentence) {
+        Set<String> set = new HashSet<>(dictionary.length);
+        set.addAll(Arrays.asList(dictionary));
+
+        int[] dp = new int[sentence.length() + 1];
+        for (int i = 1; i <= sentence.length(); i++) {
+            dp[i] = dp[i - 1] + 1;
+            for (int j = 0;j < i;j++) {
+                if (set.contains(sentence.substring(j, i))) {
+                     dp[i] = Math.min(dp[i], dp[j]);
+                }
+            }
+        }
+        return dp[sentence.length()];
+    }
+}
 ```
 
 ### **...**

leetcode/lcci/17.13.Re-Space/Solution.java

@@ -1,3 +1,7 @@
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
 class Solution {
     public int respace(String[] dictionary, String sentence) {
         Set<String> set = new HashSet<>(dictionary.length);