/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 vote224 views1 answer
Modulo subtraction
C++
0 vote243 views1 answer
Stl map remove item
C++
0 vote243 views1 answer
Qt asynchronous HTTP request
C++
1 vote260 views1 answer
Vector remove class
C++
0 vote233 views1 answer
Temparory Email Id
C++
1 vote245 views1 answer
Rapidjson write stringbuffer to file
C++
0 vote246 views1 answer
Cstring to string
C++
0 vote249 views1 answer
C++ string erase all occurrences
C++
0 vote267 views1 answer
Cpp gui
C++
3 votes236 views1 answer
Set precision with fixed c++
C++