[N-0] add 728

Author: fishercoder1534

README.md

@@ -22,6 +22,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Difficulty  | Tag          | Notes
 |-----|----------------|---------------|---------------|---------------|-------------|--------------|-----
+|728|[Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_728.java) | O(n*k) k is the average number of digits of each number in the given array| O(1) | Easy | 
 |727|[Minimum Window Subsequence](https://leetcode.com/problems/minimum-window-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_727.java) | O(m*n) | O(m*n) | Hard | DP
 |725|[Split Linked List in Parts](https://leetcode.com/problems/split-linked-list-in-parts/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_725.java) | O(n+k) | O(k) | Medium | LinkedList
 |724|[Find Pivot Index](https://leetcode.com/problems/find-pivot-index/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_724.java) | O(n) | O(1) | Easy | Array

src/main/java/com/fishercoder/solutions/_728.java

@@ -0,0 +1,46 @@
+package com.fishercoder.solutions;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * 728. Self Dividing Numbers
+ *
+ * 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.
+ */
+public class _728 {
+    public static class Solution1 {
+        public List<Integer> selfDividingNumbers(int left, int right) {
+            List<Integer> result = new ArrayList<>();
+            for (int num = left; num <= right; num++) {
+                if (isSelfDividing(num)) {
+                    result.add(num);
+                }
+            }
+            return result;
+        }
+
+        private boolean isSelfDividing(int num) {
+            int tmp = num;
+            while (tmp != 0) {
+                int digit = tmp % 10;
+                if (digit == 0 || num % digit != 0) {
+                    return false;
+                }
+                tmp /= 10;
+            }
+            return true;
+        }
+    }
+}

src/test/java/com/fishercoder/_728Test.java

@@ -0,0 +1,27 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._728;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+
+import static org.junit.Assert.assertEquals;
+
+public class _728Test {
+    private static _728.Solution1 solution1;
+    private static List<Integer> expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _728.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        expected = Arrays.asList(1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 22);
+        assertEquals(expected, solution1.selfDividingNumbers(1, 22));
+    }
+
+}