solve Self Dividing Numbers

Author: P-ppc

README.md

@@ -7,4 +7,5 @@ All solutions will be accepted!
 |771|[Jewels and Stones](https://leetcode-cn.com/problems/jewels-and-stones/description/)|[java/py/js](./algorithms/JewelsAndStones)|Easy|
 |657|[Judge Route Circle](https://leetcode-cn.com/problems/judge-route-circle/description/)|[java/py/js](./algorithms/JudgeRouteCircle)|Easy|
 |461|[Hamming Distance](https://leetcode-cn.com/problems/hamming-distance/description/)|[java/py/js](./algorithms/HammingDistance)|Easy|
-|476|[Number Complement](https://leetcode-cn.com/problems/number-complement/description/)|[java/py/js](./algorithms/NumberComplement)|Easy|
+|476|[Number Complement](https://leetcode-cn.com/problems/number-complement/description/)|[java/py/js](./algorithms/NumberComplement)|Easy|
+|728|[Self Dividing Numbers](https://leetcode-cn.com/problems/self-dividing-numbers/description/)|[java/py/js](./algorithms/SelfDividingNumbers)|Easy|

algorithms/SelfDividingNumbers/README.md

@@ -0,0 +1,2 @@
+# Self Dividing Numbers
+This program is easy to solve

algorithms/SelfDividingNumbers/Solution.java

@@ -0,0 +1,23 @@
+class Solution {
+    public List<Integer> selfDividingNumbers(int left, int right) {
+        List<Integer> list = new ArrayList<Integer>();
+        for (int i = left; i <= right; i++) {
+            if (isSelfDividingNumber(i)) {
+                list.add(i);
+            }
+        }
+        return list;
+    }
+    
+    private boolean isSelfDividingNumber(int num) {
+        int originNum = num;
+        while (num > 0) {
+            int mod = num % 10;
+            if (mod == 0 || originNum % mod != 0) {
+                return false;
+            }
+            num /= 10;
+        }
+        return true;
+    }
+}

algorithms/SelfDividingNumbers/solution.js

@@ -0,0 +1,26 @@
+/**
+ * @param {number} left
+ * @param {number} right
+ * @return {number[]}
+ */
+var selfDividingNumbers = function(left, right) {
+    array = []
+    for (let i = left; i <= right; i++) {
+        if (isSelfDividingNumber(i)) {
+            array.push(i)
+        }
+    }
+    return array
+};
+
+var isSelfDividingNumber = function (num) {
+    originNum = num
+    while (num > 0) {
+        mod = num % 10
+        if (mod === 0 || originNum % mod !== 0) {
+            return false
+        }
+        num = parseInt(num / 10)
+    }
+    return true
+};

algorithms/SelfDividingNumbers/solution.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def selfDividingNumbers(self, left, right):
+        """
+        :type left: int
+        :type right: int
+        :rtype: List[int]
+        """
+        return [num for num in range(left, right + 1) if self.isSelfDividingNumber(num)]
+    
+    def isSelfDividingNumber(self, num):
+        origin_num = num
+        while num > 0:
+            mod = num % 10
+            if mod == 0 or origin_num % mod != 0:
+                return False
+            num /= 10
+        return True