codility: MaxProductOfThree

A non-empty zero-indexed array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N).

For example, array A such that:

 

  A[0] = -3
  A[1] = 1
  A[2] = 2
  A[3] = -2
  A[4] = 5
  A[5] = 6

contains the following example triplets:

• (0, 1, 2), product is −3 * 1 * 2 = −6
• (1, 2, 4), product is 1 * 2 * 5 = 10
• (2, 4, 5), product is 2 * 5 * 6 = 60

Your goal is to find the maximal product of any triplet.

Write a function:

int solution(vector<int> &A);

that, given a non-empty zero-indexed array A, returns the value of the maximal product of any triplet.

For example, given array A such that:

 

  A[0] = -3
  A[1] = 1
  A[2] = 2
  A[3] = -2
  A[4] = 5
  A[5] = 6

the function should return 60, as the product of triplet (2, 4, 5) is maximal.

Assume that:

• N is an integer within the range [3..100,000];
• each element of array A is an integer within the range [−1,000..1,000].

Complexity:

• expected worst-case time complexity is O(N*log(N));
• expected worst-case space complexity is O(1), beyond input storage (not counting the storage required for input arguments).

这是个非常简单的题，但是为什么还要写出来呢！因为我发现我真的离一遍bug free很远啊！

首先排序是肯定的。之后我想当然的顺序遍历求A[i]*A[i+1]*A[i+2]了。当时这么做的时候我已经想到有负数这么回事了，但是仍然神志不清的认为都遍历了还能得不到max吗（点个蜡烛。。。）

改了之后的代码如下：

// you can also use includes, for example:
#include <algorithm>
int solution(vector<int> &A) {
    // write your code in C++98
    sort(A.begin(),A.end());
    int size = A.size();
    return max(A[0]*A[1]*A[size-1],A[size-3]*A[size-2]*A[size-1]);
}

这么短的代码都没法一次写对，你还找什么工作。。。默哀吧。

转载于:https://www.cnblogs.com/parapax/p/3637756.html