#include
using namespace std;
void left(char a[], int n, int k);
int main() {
int n, k;
char a[100];
cin >> n;
cin >> k;
cin >> a;
left(a, n, k);
cout << a;
return 0;
}
void reverse(char a[], int low, int high) {
int i = low, j = high, temp;
while (i < j) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
i++;
j–;
}
}
void left(char a[], int n, int k) {
reverse(a, 0, k - 1);
reverse(a, k, n - 1);
reverse(a, 0, n - 1);
}
数组左移分治法
最新推荐文章于 2021-12-05 13:35:19 发布