要求时间复杂度: ,空间复杂度: 。
数据范围:
long long solve(int* A, int ALen ) { int i,j,temp; long produce; for(i=0;i<ALen-1;i++) { for(j=i+1;j<ALen;j++) { if(A[i]>A[j]) { temp = A[i]; A[i] = A[j]; A[j] = temp; } } } if(A[ALen-2] * A[ALen-3]>=A[0] * A[1]) { produce = (long) A[ALen-1] * A[ALen-2] * A[ALen-3]; return produce; } else { produce = (long) A[0] * A[1] * A[ALen-1]; return produce; } }