408数据结构算法-2010

#include <iostream>

using namespace std;

void showArray(int *array, int n) {
    for (int i = 0; i < n; i++) {
        cout << array[i] << " ";
    }
    cout << endl;
}

void leftTurn(int *array, int n, int p) {
    int temp[p];
    for (int i = 0; i < p; i++) {
        temp[i] = array[i]; //临时数组存储前p个元素
    }
    for (int i = 0; i < n - p; i++) {
        array[i] = array[i + p]; //将其余的元素往前移动
    }
    for (int i = n - p; i < n; i++) {
        array[i] = temp[i - p - 1];
    }
}

int main() {
    int array[] = {1, 2, 3, 4, 5, 57, 8};
    showArray(array, 7);
    leftTurn(array, 7, 3);
    showArray(array, 7);
}
// 1 2 3 4 5 57 8
// 4 5 57 8 1 2 3