Added solution for problem 0917

LeetCode/0728_Self_Dividing_Numbers.py

@@ -0,0 +1,10 @@
+class Solution:
+    def selfDividingNumbers(self, left: int, right: int) -> List[int]:
+        result = []
+        for i in range(left, right+1):
+            for char in str(i):
+                if int(char)==0 or i % int(char)!=0:
+                    break
+            else:
+                result.append(i)
+        return result

LeetCode/0917_Reverse_Only_Letters.py

@@ -0,0 +1,13 @@
+class Solution:
+    def reverseOnlyLetters(self, S: str) -> str:
+        letters = []
+        for c in S:
+            if c.isalpha():
+                letters.append(c)
+        result = []
+        for c in S:
+            if c.isalpha():
+                result.append(letters.pop())
+            else:
+                result.append(c)
+        return ''.join(result)