/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

1 vote127 views1 answer
Sort array using inbuilt sort function in decreasing order
C++
0 vote121 views1 answer
Map::begin
C++
1 vote229 views1 answer
Typedef vector c++
C++
0 vote145 views2 answers
What are manipulators in c++
C++
6 votes120 views1 answer
C++ create threads
C++
1 vote124 views1 answer
How to compare two char* in c++
C++
0 vote129 views1 answer
Reading in lines from a file to a vector c++
C++
8 votes124 views6 answers
Char to int in c++
C++
0 vote205 views5 answers
Palindrome String
C++
0 vote137 views1 answer
Flake8 max line length
C++