数组旋转系列二

题目

给定一个大小为 N 的整数数组 arr[] 和一个整数，任务是将数组元素向左旋转 d 个位置。

Examples:

Input:
arr[] = {1, 2, 3, 4, 5, 6, 7}, d = 2
Output: 3 4 5 6 7 1 2
Input: arr[] = {3, 4, 5, 6, 7, 1, 2}, d=2
Output: 5 6 7 1 2 3 4

方法:

Algorithm reverse(arr, start, end):
mid = (start + end)/2
loop from i = start to mid:
swap (arr[i], arr[end-(mid-i+1)])

Algorithm rotate(arr, d, N):
reverse(arr, 1, d) ;
reverse(arr, d + 1, N);
reverse(arr, 1, N);

using System;

namespace csharptest
{
    public class GFG
    {
        static void leftRotate(int[] arr, int d)
        {
    
            if (d == 0)
                return;
            int n = arr.Length;
            d = d % n;
            reverseArray(arr, 0, d - 1);
            reverseArray(arr, d, n - 1);
            reverseArray(arr, 0, n - 1);
        }
    
        static void reverseArray(int[] arr, int start,
                                int end)
        {
            int temp;
            while (start < end) {
                temp = arr[start];
                arr[start] = arr[end];
                arr[end] = temp;
                start++;
                end--;
            }
        }
    
        static void printArray(int[] arr)
        {
            for (int i = 0; i < arr.Length; i++)
                Console.Write(arr[i] + " ");
        }
    
        public static void Main()
        {
            int[] arr = { 1, 2, 3, 4, 5, 6, 7 };
            int n = arr.Length;
            int d = 2;
    
            leftRotate(arr, d);
            printArray(arr);
        }
    }
}

Output
3 4 5 6 7 1 2

时间复杂度：O(N)
空间杂度：O(1)