The Question

Example Input

1. ([1,3,4,5,6] 0)

2. ([1,3,4,5,6] 1)

3. ([1,3,4,5,6] 2)

4. ([1,3,4,5,6] 3)

5. ([1,3,4,5,6] 4)

6. ([1,3,4,5,6] 5)

Example Output

1. [1,3,4,5,6]

2. [6,1,3,4,5]

3. [5,6,1,3,4]

4. [4,5,6,1,3]

5. [3,4,5,6,1]

6. [1,3,4,5,6]

The Solution

Swift

public func cyclicRotation(_ array : inout [Int], rotationCount: Int) -> [Int] {
    if array.count == rotationCount 
    || rotationCount == 0 
    || array.isEmpty { 
        return array
    }

    let rotation = rotationCount % array.count
    let range = 0...(array.count - 1 - rotation)
    let firstPick = array[range]
    array.removeSubrange(range)
    return array + firstPick
}

Rust

fn cyclic_rotation(array: &mut [i32], rotation_count: usize) -> Vec<i32> {
    if array.len() == rotation_count || rotation_count == 0 || array.is_empty() {
        return array.to_vec();
    }

    let rotation = rotation_count % array.len();
    let range = 0..(array.len() - rotation);
    let first_pick = array[range].to_vec();
    array.drain(range);
    array.extend_from_slice(&first_pick);
    array.to_vec()
}