leetcode+ 数组偏移

点击打开链接
class Solution {
public:
    void rotate(vector<int>& nums, int k) {
        int len = nums.size();
        int Arr[len+1];
        for(int i=0;i<len;i++) Arr[(i+k)%len] =nums[i];
        for(int i=0;i<len; i++) nums[i]=Arr[i];
    }
};

猜你喜欢

转载自blog.csdn.net/u013554860/article/details/80954760
今日推荐