Add 728 link

Author: qiyuangong

README.md

@@ -189,6 +189,7 @@ I'm currently working on [Analytics-Zoo](https://github.com/intel-analytics/anal
 | 717 | [1-bit and 2-bit Characters](https://leetcode.com/problems/1-bit-and-2-bit-characters/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/717_1-bit_and_2-bit_Characters.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/717_1-bit_and_2-bit_Characters.java) | 1. Go through bits, 1 skip next, O(n) and O(1)<br>2. Find second last zero reversely, O(n) and O(1) |
 | 720 | [Longest Word in Dictionary](https://leetcode.com/problems/longest-word-in-dictionary/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/720_Longest_Word_in_Dictionary.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/720_Longest_Word_in_Dictionary.java) | 1. Brute Force, O(sum(w^2)) and O(w)<br>2. Tire Tree, O(sum(w) and O(w))<br>3. Sort and word without last char, O(nlogn + sum(w)) and O(w) |
 | 724 | [Find Pivot Index](https://leetcode.com/problems/find-pivot-index/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/724_Find_Pivot_Index.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/724_Find_Pivot_Index.java) | Seach the array to find a place where left sum is equal to right sum, O(n) and O(1) |
+| 728 | [Self Dividing Numbers](https://leetcode.com/problems/self-dividing-numbers/solution/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/728_Self_Dividing_Numbers.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/728_Self_Dividing_Numbers.java) | Brute Force check every digit, O(nlogD) and O(1) |
 | 733 | [Flood Fill](https://leetcode.com/problems/flood-fill/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/733_Flood_Fill.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/733_Flood_Fill.java) | 1. DFS with stack or recursive, O(n) and O(n)<br>2. BFS with queue, O(n) and O(n) |
 | 743 | [Network Delay Time](https://leetcode.com/problems/network-delay-time/) | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/743_Network_Delay_Time.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/743_Network_Delay_Time.java) | Let V == N, then: 1. DFS, O(V^V+ElgE), O(V+E)<br>2. Dijkstra, O(V^2+E), O(V+E)|
 | 751 | [IP to CIDR](https://leetcode.com/problems/ip-to-cidr/) &hearts; | [Python](https://github.com/qiyuangong/leetcode/blob/master/python/751_IP_to_CIDR.py) [Java](https://github.com/qiyuangong/leetcode/blob/master/java/751_IP_to_CIDR.java) | Bit manipulations, incrementail is 1 << (32 - mask) |

java/728_Self_Dividing_Numbers.java

@@ -1,35 +1,27 @@
 class Solution {
-    public List<Integer> selfDividingNumbers(int left, int right) 
-    {
+    public List<Integer> selfDividingNumbers(int left, int right) {
         LinkedList list = new LinkedList();
-        for(int i = left; i <= right; i++)
-        {
+        for(int i = left; i <= right; i++) {
             if(isSelfDiving(i))
             list.add(i);
         }
         return list;
     }
 
-    public boolean isSelfDiving(int num)
-    {
+    public boolean isSelfDiving(int num) {
             int digit = num % 10;
             int temp = num;
             boolean isTrue = true;
-            while(temp != 0)
-            {
-                if(digit == 0 || num % digit != 0)
-                {
+            while(temp != 0) {
+                // 0 is special
+                if(digit == 0 || num % digit != 0) {
                     isTrue = false;
                     break;
-                }
-                else
-                {
+                } else {
                     temp /= 10;
-                    digit = temp%10;
+                    digit = temp % 10;
                 }
             }
             return isTrue;
-
     }
-        
 }

python/728_Self_Dividing_Numbers.py

@@ -0,0 +1,7 @@
+class Solution:
+    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
+        # check every digit
+        return [x for x in range(left, right+1) if all([int(i) != 0 and x % int(i)==0 for i in str(x)])]
+
+    # def selfDividingNumbers(self, left: int, right: int) -> List[int]:
+    #     return [x for x in range(left, right+1) if all((i and (x % i==0) for i in map(int, str(x))))]