solves rotate array in python

Author: anishLearnsToCode

Diff for: README.md

@@ -52,7 +52,7 @@
 | 170 | [Two Sum  III - Data Structure Design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | Easy | |
 | 171 | [Excel Sheet Column Number](https://leetcode.com/problems/excel-sheet-column-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ExcelSheetColumnNumber.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/excel_sheet_column_number.py) |
 | 172 | [Factoring Trailing Zeroes](https://leetcode.com/problems/factorial-trailing-zeroes) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/FactorialTrailingZeros.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/factorial_trailing_zeroes.py) | 
-| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RotateArray.java) | 
+| 189 | [Rotate Array](https://leetcode.com/problems/rotate-array) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/RotateArray.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/rotate_array.py) | 
 | 190 | [Reverse Bits](https://leetcode.com/problems/reverse-bits) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ReverseBits.java) | 
 | 191 | [Number of One Bits](https://leetcode.com/problems/number-of-1-bits) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/NumberOf1Bit.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/number_of_1_bits.py) |
 | 198 | [House Robber](https://leetcode.com/problems/house-robber) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/HouseRobber.java) |

Diff for: python/factorial_trailing_zeroes.py

@@ -1,7 +1,7 @@
 class Solution:
     def trailingZeroes(self, n: int) -> int:
         divisor, count = 5, 0
-        while n // divisor > 0:
+        while divisor <= n:
             count += n // divisor
             divisor *= 5
         return count

Diff for: python/rotate_array.py

@@ -0,0 +1,31 @@
+from typing import List
+
+
+class Solution:
+    def rotate(self, nums: List[int], k: int) -> None:
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        k %= len(nums)
+        if k == 0:
+            return
+        temp = nums[-k:]
+        for i in range(len(nums) - 1, k - 1, -1):
+            nums[i] = nums[i - k]
+        for i, val in enumerate(temp):
+            nums[i] = val
+
+    def reverse(self, A, i, j):
+        while i < j:
+            A[i], A[j] = A[j], A[i]
+            i += 1
+            j -= 1
+
+    # this is method no. 2 to solve it with O(1) space complexity
+    def rotate_2(self, A, k):
+        L = len(A)
+        k %= L
+        if k:
+            self.reverse(A, 0, L - 1)
+            self.reverse(A, 0, k - 1)
+            self.reverse(A, k, L - 1)