Add the solution to the 0189_Rotate_Array.py file

Author: DavidBanda

LeetCode/0189_Rotate_Array.py

@@ -0,0 +1,6 @@
+class Solution:
+ def rotate(self, nums: List[int], k: int) -> None:
+ for i in range(k):
+ lastValue = nums.pop()
+ nums.insert(0, lastValue)
+ return nums