题目:
给定一个长度为N整形数组,只能用乘法不能用除法,计算任意N-1个数的组合中乘积最大的一组,并写出时间复杂度;
#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
#define NSIZ 10000
int a[NSIZ];
int pre[NSIZ]; //pre[i] = a[0] * a[1] * ... *a[i - 1] 表示前i-1项乘积
int post[NSIZ]; //post[i] = post[i + 1] * post[i + 2] * ... * post[n-1]乘积
int result[NSIZ];//result[i] = pre[i] * post[i]表示除了a[i]之外的所有元素乘积
//方法1
int getValue(int arr[], int n)
{
int minN = INT_MIN;
int i = 0;
pre[0] = 1;
for (i = 1;i < n; ++i)
{
pre[i] = pre[i - 1] * arr[i- 1];
}
post[n-1] = 1;
for (i = n - 2;i >= 0; --i)
{
post[i] = post[i + 1] * arr[i+1];
}
for(i = 0;i < n; ++i)
{
result[i] = pre[i] * post[i];
if (minN < result[i])
{
minN = result[i];
}
}
return minN;
}
int main()
{
int arr[] = {1,0, 0 -2, 3, 4};
int n = sizeof(arr)/sizeof(arr[0]);
int minN = getValue(arr, n);
printf("%d \n", minN);
return 0;
}