189. Rotate Array

problem

189. Rotate Array

solution1: 暴力破解法(Time Limit Exceeded)

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

solution2: 空间换取时间

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

1. Leetcode_Rotate Array;