From 9732473e1e159f2395732103284d69bb15d17d2e Mon Sep 17 00:00:00 2001 From: Yash Nagare Date: Sat, 3 Oct 2020 11:58:56 +0530 Subject: [PATCH 1/2] Added solution for problem 0917 --- LeetCode/0917_Reverse_Only_Letters.py | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 LeetCode/0917_Reverse_Only_Letters.py diff --git a/LeetCode/0917_Reverse_Only_Letters.py b/LeetCode/0917_Reverse_Only_Letters.py new file mode 100644 index 0000000..90115cb --- /dev/null +++ b/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) \ No newline at end of file From 05455463e0b6151f43fc7405462f3bd008da1cfc Mon Sep 17 00:00:00 2001 From: Yash Nagare Date: Sat, 3 Oct 2020 16:45:15 +0530 Subject: [PATCH 2/2] Added solution for problem 0728 --- LeetCode/0728_Self_Dividing_Numbers.py | 10 ++++++++++ 1 file changed, 10 insertions(+) create mode 100644 LeetCode/0728_Self_Dividing_Numbers.py diff --git a/LeetCode/0728_Self_Dividing_Numbers.py b/LeetCode/0728_Self_Dividing_Numbers.py new file mode 100644 index 0000000..af5a2f0 --- /dev/null +++ b/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 \ No newline at end of file