Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- Logic:
- reverse the last k elements
- reverse the remaining elements
- revese the whole array now
- */
- class Solution:
- def rotate(self, arr: List[int], k: int) -> None:
- arr[len(arr)-k:len(arr)]=reversed(arr[len(arr)-k:len(arr)])
- print(arr)
- arr[0:len(arr)-k]=reversed(arr[0:len(arr)-k])
- arr.reverse() #no need to return so inplace reverse is needed
Advertisement
Add Comment
Please, Sign In to add comment