By

文章目录

LeetCode地址：https://leetcode.com/problems/number-of-1-bits/

Problem:
Rotate an array of n elements to the right by k steps.

For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].

Note:
Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.

思路

  • 使用两次翻转即可，第一次以k分割线翻转[4,3,2,1,7,6,5]，第二次全部翻转[5,6,7,1,2,3,4]
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution {
public:
    void inverse(int nums[],int start,int end)
    {
        int m=(start+end)/2;
        int temp;
        for(;start<=m;start++,end--)
        {
            temp=nums[start];
            nums[start]=nums[end];
            nums[end]=temp;
        }
    }
   
    void rotate(int nums[], int n, int k) {
        k=k%n;
        if(n-k-1>=0)
        {
            inverse(nums,0,n-k-1);
        }
        inverse(nums,n-k,n-1);
        inverse(nums,0,n-1);
    }
    
    
};

本作品采用[知识共享署名-非商业性使用-相同方式共享 2.5]中国大陆许可协议进行许可，我的博客欢迎复制共享，但在同时，希望保留我的署名权kubiCode，并且，不得用于商业用途。如您有任何疑问或者授权方面的协商，请给我留言。

文章目录