An elegant solution reverses the entire array, then reverses the first k elements, then reverses the rest.

Rotate Array

medium

Acceptance: 43%

Arrays

Shift every element of an integer array to the right by k positions. Elements that move past the end wrap around to the beginning. The value of k is non-negative and may exceed the array's length.

Examples

Example 1:

Input:arr = [10,20,30,40,50], k = 2

Output:[40,50,10,20,30]

Explanation: After two right rotations, the last two elements wrap to the front.

Example 2:

Input:arr = [5,-3,8], k = 4

Output:[8,5,-3]

Explanation: Since k=4 exceeds the length 3, the effective rotation is 4 mod 3 = 1 step. The last element wraps to the front.

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Rotate Array

Examples

Hints

Related Problems