static class Function
{
/// <summary>
/// 反序
/// </summary>
/// <typeparam name="T">数据类型</typeparam>
/// <param name="arr">数组</param>
/// <param name="b">起点下标</param>
/// <param name="e">末点下标</param>
private static void Reverse<T>(ref T[] arr, int b, int e)
{
for (; b < e; b++, e--)
{
T temp = arr[e];
arr[e] = arr[b];
arr[b] = temp;
}
}
/// <summary>
/// 循环右移
/// </summary>
/// <typeparam name="T">数据类型</typeparam>
/// <param name="arr">数组</param>
/// <param name="k">移位数</param>
public static void RightShift<T>(ref T[] arr, int k)
{
int N = arr.Length;
k %= N;
Reverse(ref arr, 0, N - k - 1);
Reverse(ref arr, N - k, N - 1);
Reverse(ref arr, 0, N - 1);
}
}
参考:
假设原数组序列为abcd1234,要求变换成的数组序列为1234abcd,即循环右移了4位。比较之后,不难看出,其中有两段的顺序是不变的:1234和abcd,可把这两段看成两个整体。右移K位的过程就是把数组的两部分交换一下。变换的过程通过以下步骤完成:
1. 逆序排列abcd:abcd1234 → dcba1234;
2. 逆序排列1234:dcba1234 → dcba4321;
3. 全部逆序:dcba4321 → 1234abcd。
Reverse(char *arr, int b, int e)
{
for(; b < e; b++, e--)
{
char temp = arr[e];
arr[e] = arr[b];
arr[b] = temp;
}
}
RightShift(char *arr, int N, int k)
{
k %= N;
Reverse(arr, 0, N-k-1);
Reverse(arr, N-k, N-1);
Reverse(arr, 0, N-1);
}
http://www.cnblogs.com/JCSU/articles/1321582.html
—Gaius Julius Caesar ‘s Blog