/C++/Rotate an array of n elements to the right by k steps

Rotate an array of n elements to the right by k steps

public void rotate(int[] nums, int k) {
        k %= nums.length;
        reverse(nums, 0, nums.length - 1);
        reverse(nums, 0, k - 1);
        reverse(nums, k, nums.length - 1);
    }
    public void reverse(int[] nums, int start, int end) {
        while (start < end) {
            int temp = nums[start];
            nums[start] = nums[end];
            nums[end] = temp;
            start++;
            end--;
        }
    }

Source: massivealgorithms.blogspot.com

Similar codes

0 vote150 views1 answer
Print maximum sum subarray
C++
20 votes197 views3 answers
How to append to a vector c++
C++
1 vote179 views1 answer
Isalpha c++
C++
0 vote157 views1 answer
Unpack tuple c++
C++
3 votes153 views1 answer
Convert refference to pointer c++
C++
0 vote162 views1 answer
Qt asynchronous HTTP request
C++
2 votes146 views1 answer
Java print f int
C++
1 vote175 views1 answer
Roscpp publish int32
C++
0 vote162 views1 answer
C++ call overriden method from constructor
C++
1 vote296 views1 answer
Heap pinter c++
C++