- 递归实现
#include<stdio.h>
#include<stdlib.h>
int* max_crossing_subarray(int *num, int left, int mid, int right);
void k1(int* ans, int x, int y, int z);
int* max_subarray(int* num, int left, int right);
void main() {
int num[10] = {
1,-3,5,-2,4,-6,7,4,0,-3 };
int* ans = max_subarray(num, 1, 10);
printf("%d %d %d", ans[0], ans[1], ans[2]);
free(ans);
}
int* max_crossing_subarray(int *num