1 3 4 2 5 m=2 n个数据
思路:1.将整个数据全部逆转 5 2 4 3 1
2.区间逆转 (4 2 5) (1 3 )
下标关系 0-(n-m-1) (n-m)-(n-1)
时间复杂度O(n) 空间复杂度(1)
#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<assert.h>
void Reverse(int* arr, int len,int begin,int end) {
assert(arr != NULL && len > 0 && begin <= end);
int temp;
int n = (end - begin + 1) / 2;
for (int i = 0; i < n; i++,begin++,end–) {
temp = arr[begin];
arr[begin] = arr[end];
arr[end] = temp;
}
}//逆转
void Adjusy_Reverse(int* arr, int len, int m) {
assert(arr != NULL);
//整体数据逆转
Reverse(arr, len, 0, len - 1);
//区间逆转
Reverse(arr, len, 0, len - m - 1);
Reverse(arr, len, len - m, len - 1);
}
int main() {
int arr[] = { 2,2,7,9,0,3,8,2,1,3};
int len = sizeof(arr) / sizeof(arr[0]);
Adjusy_Reverse(arr, len, 2);
for (int i = 0; i < len; i++) {
printf(“%5d”, arr[i]);
}
return 0;
}