/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

22 votes210 views4 answers
Height of the tree
C++
0 vote247 views1 answer
C++ fibo
C++
3 votes236 views2 answers
C++ check if string contains substring
C++
1 vote205 views1 answer
Linked list with classes c++
C++
0 vote232 views1 answer
Check whether kth bit is 1
C++
0 vote207 views1 answer
Cpp convert vector to set
C++
0 vote198 views1 answer
Clear qlayout
C++
4 votes212 views2 answers
Long pi in c++
C++
1 vote219 views1 answer
C++ coding structure
C++
-1 vote220 views1 answer
C++ string to vector int
C++