Скачать или смотреть LEETCODE PROBLEM NO. 189 (ROTATE ARRAY) SOLUTION IN JAVA.

Rotate Array:
Given an integer array nums, rotate the array to the right by k steps, where k is non-negative.



Example 1:

Input: nums = [1,2,3,4,5,6,7], k = 3
Output: [5,6,7,1,2,3,4]
Explanation:
rotate 1 steps to the right: [7,1,2,3,4,5,6]
rotate 2 steps to the right: [6,7,1,2,3,4,5]
rotate 3 steps to the right: [5,6,7,1,2,3,4]
Example 2:

Input: nums = [-1,-100,3,99], k = 2
Output: [3,99,-1,-100]
Explanation:
rotate 1 steps to the right: [99,-1,-100,3]
rotate 2 steps to the right: [3,99,-1,-100]


Intuition
Considering reversing the array might lead you to a solution for this problem.

Approach
First, it calculates the effective rotation amount by taking the modulus of k with the length of the array, ensuring that k is within the range of the array length.
Then, it calls the reverse function three times:
First, it reverses the entire array, effectively placing the last k elements at the start of the array.
Second, it reverses the first k elements, moving them to the end of the array.
Finally, it reverses the remaining elements, restoring the original order of the array with the elements rotated to the right by k steps.
Complexity
Time complexity: O(n)
Space complexity: O(1)