数据结构 | 数组元素循环左移TQ-P1

Posted 2021-06-27 zhulu506

数组元素循环左移算法代码实现

问题描述

问题解答

#include <bits/stdc++.h>

#define N 100

using namespace std;

void Reverse(int R[], int l, int r)
{
    int i, j;
    int temp;
    for (i = l, j = r; i < j; i++, j--)
    {
        temp = R[i];
        R[i] = R[j];
        R[j] = temp;
    }
}

void RCR(int R[], int n, int P)
{
    if (P <= 0 || P >= n)
    {
        cout << "ERROR" << endl;
        exit(0);
    }
    else
    {
        Reverse(R, 0, P - 1);
        Reverse(R, P, n - 1);
        Reverse(R, 0, n - 1);
    }
}

int main()
{

    int i, n, P, R[N];

    cin >> n >> P;

    for (i = 0; i < n; i++)
    {
        cin >> R[i];
    }

    RCR(R, n, P);

    for (i = 0; i < n; i++)
    {
        cout << R[i] << " ";
    }

    return 0;
}