189_RotateArray - a920604a/leetcode GitHub Wiki

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        // copy vector
        vector<int> temp = nums;
        for(int i=0;i<n;++i){
            nums[i] = temp[(n-k+i)%n];
        }
    }
};

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int n = nums.size();
        k%=n;
        reverse(nums.begin(),nums.begin()+(n-k) );
        reverse(nums.begin()+(n-k), nums.end());
        reverse(nums.begin(), nums.end());      
    }
};

class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        
        // bubble rotate
        for(int i=0;i<k;++i){
            for(int j = nums.size()-1;j>0;j--){
                swap(nums[j], nums[j-1]);
            }
        }
    }
};