Merge remote-tracking branch 'origin/master'

# Conflicts:
#	README.md

Author: relish-wang

README.md

@@ -15,8 +15,10 @@
 | :-----------------: | -------------------------------------- | :--------------: | :-------: | :------------: |
 | [1][1-question]     | [Two Sum][1-tips]                      | [✅][1-kotlin]   |           | [✅][1-java]   |
 | [771][771-question] | [Jewels and Stones][771-tips]          | [✅][771-kotlin] |           | [✅][771-java] |
+| [728][728-question] | [Self Dividing Numbers][728-tips]      |                  |           | [✅][728-java] |
 | [804][804-question] | [Unique Morse Code Words][804-tips]    |                  |           | [✅][804-java] |
 
+
 ## [Medium](https://leetcode.com/problemset/all/?difficulty=Medium)题解
 |         题目         | 题解                                   | kotlin        | JavaScript |     Java      |
 | :-----------------: | -------------------------------------- | :------------: | :-------: | :------------: |
@@ -36,11 +38,13 @@
 [2-question]: https://leetcode.com/problems/add-two-numbers/description/
 [771-question]: https://leetcode.com/problems/jewels-and-stones/description/
 [804-question]: https://leetcode.com/problems/unique-morse-code-words/description/
+[728-question]: https://leetcode.com/problems/self-dividing-numbers/description/
 
 [1-tips]: ./tips/1/README.md
 [2-tips]: ./tips/2/README.md
 [771-tips]: ./tips/771/README.md
 [804-tips]: ./tips/804/README.md
+[728-tips]: ./tips/728/README.md
 
 [1-kotlin]: ./src/_1/kotlin/Solution.kt
 [2-kotlin]: ./src/_2/kotlin/Solution.kt
@@ -50,3 +54,4 @@
 [2-java]: ./src/_2/Solution.java
 [771-java]: ./src/_771/Solution.java
 [804-java]: ./src/_804/Solution.java
+[728-java]: ./src/_728/Solution.java

src/_728/Solution.java

@@ -0,0 +1,67 @@
+package _728;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class Solution {
+    public List<Integer> selfDividingNumbers(int left, int right) {
+
+//         // 打表方式
+//        int sum = 0;
+//        System.out.print("{");
+//        for (int i = left; i < right; i++) {
+//            int num = i;
+//            int div;
+//            while (num != 0) {
+//                div = num % 10;
+//                if (div == 0) {
+//                    break;
+//                }
+//                if ((i % div) != 0) {
+//                    break;
+//                }
+//                num /= 10;
+//            }
+//            if (num == 0) {
+//                System.out.print(i + ",");
+//                sum++;
+//            }
+//        }
+//        System.out.println("}");
+//        System.out.println("sum=" + sum);
+//        return null;
+
+        int[] ans = new int[] {1,2,3,4,5,6,7,8,9,11,12,15,22,24,33,36,44,48,55,66,77,88,99,111,112,115,122,124,126,128,
+                132,135,144,155,162,168,175,184,212,216,222,224,244,248,264,288,312,315,324,333,336,366,384,396,412,424,
+                432,444,448,488,515,555,612,624,636,648,666,672,728,735,777,784,816,824,848,864,888,936,999,1111,1112,
+                1113,1115,1116,1122,1124,1128,1131,1144,1155,1164,1176,1184,1197,1212,1222,1224,1236,1244,1248,1266,
+                1288,1296,1311,1326,1332,1335,1344,1362,1368,1395,1412,1416,1424,1444,1448,1464,1488,1515,1555,1575,
+                1626,1632,1644,1662,1692,1715,1722,1764,1771,1824,1848,1888,1926,1935,1944,1962,2112,2122,2124,2128,
+                2136,2144,2166,2184,2196,2212,2222,2224,2226,2232,2244,2248,2262,2288,2316,2322,2328,2364,2412,2424,
+                2436,2444,2448,2488,2616,2622,2664,2688,2744,2772,2824,2832,2848,2888,2916,3111,3126,3132,3135,3144,
+                3162,3168,3171,3195,3216,3222,3264,3276,3288,3312,3315,3324,3333,3336,3339,3366,3384,3393,3432,3444,
+                3492,3555,3612,3624,3636,3648,3666,3717,3816,3864,3888,3915,3924,3933,3996,4112,4116,4124,4128,4144,
+                4164,4172,4184,4212,4224,4236,4244,4248,4288,4332,4344,4368,4392,4412,4416,4424,4444,4448,4464,4488,
+                4632,4644,4824,4848,4872,4888,4896,4932,4968,5115,5155,5355,5515,5535,5555,5775,6126,6132,6144,6162,
+                6168,6192,6216,6222,6264,6288,6312,6324,6336,6366,6384,6432,6444,6612,6624,6636,6648,6666,6696,6762,
+                6816,6864,6888,6912,6966,6984,7112,7119,7175,7224,7266,7371,7448,7476,7644,7728,7777,7784,8112,8128,
+                8136,8144,8184,8224,8232,8248,8288,8328,8424,8448,8488,8496,8616,8664,8688,8736,8824,8832,8848,8888,
+                8928,9126,9135,9144,9162,9216,9288,9315,9324,9333,9396,9432,9612,9648,9666,9864,9936,9999};
+
+        ArrayList<Integer> list = new ArrayList<>(ans.length);
+        for (int num : ans) {
+            if (num >= left) {
+                if (num > right) {
+                    break;
+                }
+                list.add(num);
+            }
+        }
+        return list;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        solution.selfDividingNumbers(1, 10000);
+    }
+}

tips/728/README.md

@@ -0,0 +1,49 @@
+## Description
+
+A self-dividing number is a number that is divisible by every digit it contains.
+
+For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0.
+
+Also, a self-dividing number is not allowed to contain the digit zero.
+
+Given a lower and upper number bound, output a list of every possible self dividing number, including the bounds if possible.
+
+**Example 1:**
+
+```
+Input:
+left = 1, right = 22
+Output: [1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22]
+```
+
+**Note:**
+
+The boundaries of each input argument are 1 <= left <= right <= 10000.
+
+## 思路
+
+算出所给范围内的符合要求（自身能被所有位数上的数字所整除，例如128能被1、2、8整除，且自身不能含有0）的数字。范围为1-10000，范围较小可先打表。
+
+### 打表（Java）
+
+```
+int sum = 0;
+for (int i = left; i < right; i++) {
+    int num = i;
+    int div;
+    while (num != 0) {
+        div = num % 10;
+        if (div == 0) {
+            break;
+        }
+        if ((i % div) != 0) {
+            break;
+        }
+        num /= 10;
+    }
+    if (num == 0) {
+        System.out.println(i);
+        sum++;
+    }
+}
+```