旋转数组
public int[] solve (int n, int m, int[] a) {
// write code here
m=m%n;
reverse(a,0,n-1);
reverse(a,0,m-1);
reverse(a,m,n-1);
return a;
}
public void reverse(int[] a,int start,int end){
while (start<end) swap(a,start++,end--);
}
public void swap(int[] a,int m,int n){
int temp=a[m];
a[m]=a[n];
a[n]=temp;
}
