把一个数组中的元素循环右移k位,时间复杂度严格为O(n),不能是O(kn).
利用三次对调,每次对调时间复杂度为 n/2 ,sum(n/2) 刚好为N
public class Displacement {
public static void removerightk(int a[],int k){
k=k%a.length; //由于k可能大于n,所以将k化为1~n之间
int index=a.length-k;
if(k<0){
index = -k;
}
reverse(a,0,index-1);
reverse(a,index,a.length-1);
reverse(a,0,a.length-1);
}
public static void reverse(int a[],int s,int e){
System.out.println("----------");
while(s<e){
int t=a[s];
a[s]=a[e];
a[e]=t;
s++;
e--;
System.out.println(Arrays.toString(a));
}
}
public static void main(String[] args) {
int a[]={0,1,2,3,4,5,6,7,8,9};
removerightk(a, -2);
}
}
[1, 0, 2, 3, 4, 5, 6, 7, 8, 9]
[1, 0, 9, 3, 4, 5, 6, 7, 8, 2]
[1, 0, 9, 8, 4, 5, 6, 7, 3, 2]
[1, 0, 9, 8, 7, 5, 6, 4, 3, 2]
[1, 0, 9, 8, 7, 6, 5, 4, 3, 2]
[2, 0, 9, 8, 7, 6, 5, 4, 3, 1]
[2, 3, 9, 8, 7, 6, 5, 4, 0, 1]
[2, 3, 4, 8, 7, 6, 5, 9, 0, 1]
[2, 3, 4, 5, 7, 6, 8, 9, 0, 1]
[2, 3, 4, 5, 6, 7, 8, 9, 0, 1]