数组元素循环翻转(CyclicRotation)

Description

An array A consisting of N integers is given. Rotation of the array means that each element is shifted right by one index, and the last element of the array is moved to the first place. For example, the rotation of array A = [3, 8, 9, 7, 6] is [6, 3, 8, 9, 7] (elements are shifted right by one index and 6 is moved to the first place).

The goal is to rotate array A K times; that is, each element of A will be shifted to the right K times.

描述

给定一个由N个数字组成的数组，通过右移每个元素的下标索引以达到旋转的目的， 如果是最后一个元素则移动到数字第一个位置。

例如：

3, 8, 9, 7, 6 

右移一位： 6,3,8,9,7

实现代码

int[] A = new int[]{3, 8, 9, 7, 6};
int K = 3;
int[] CA = new int[A.Length];
Array.Copy(A, CA, A.Length);
for(int i = 0; i < A.Length; i++){
    int index = 0;
    if(K + i >= A.Length) {
        index = (K + i) % A.Length;
    } else {
        index = K + i;
        if(index >= A.Length){
            index = index % A.Length;
        }
    }
    Console.WriteLine("i="+i+",index = "+index+",A[i]="+A[index]+",CA[i]="+CA[index]);
    A[index] = CA[i];
}