I want to start by saying thank you for the help first.
I am tackling the cyclic rotation problem where you have to shift the contents of an list/array to the right and effectively wrapping the elements around so for example:
For example, given
A = [3, 8, 9, 7, 6] K = 3
the function should return [9, 7, 6, 3, 8]. Three rotations were made:
[3, 8, 9, 7, 6] -> [6, 3, 8, 9, 7] [6, 3, 8, 9, 7] -> [7, 6, 3, 8, 9] [7, 6, 3, 8, 9] -> [9, 7, 6, 3, 8]
my code is as follows:
def solution(A, K): new_list = [] first_index = 0 for i in range(0, K): for num in range(0, len(A) - 1): new_list.insert(0, A.pop()) print('new list {}'.format(new_list)) print('old list {}'.format(A)) if len(new_list) == 3: new_list.insert(len(new_list), A.pop(first_index)) print(new_list)
after 3 rotations I get the list as A = [8, 9, 7, 6, 3] so to me it appears to place the last element from A to the front of the new_list.
So any help or points in the right direction would be helpful thank you again.
Advertisement
Answer
So I realised I only had to loop around K times and check for an empty list. And what I got in the end is:
def solution(A, K): for i in range(0, K): # will perform K iterations of the below code if A == []: # check if list is empty return A # return A if A is the empty list A.insert(0, A.pop()) # inserts at the first index of A the last element of A return A # will return the list A