码迷,mamicode.com
首页 > 其他好文 > 详细

Codility---MaxProductOfThree

时间:2017-04-29 09:45:29      阅读:199      评论:0      收藏:0      [点我收藏+]

标签:expec   UI   data-   des   int   time   import   val   out   

Task description

A non-empty zero-indexed array A consisting of N integers is given. Theproduct 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:

class Solution { public int solution(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).

Elements of input arrays can be modified.

 

Solution
 
Programming language used: Java
Total time used: 14 minutes
Code: 00:27:07 UTC, java, final, score:  100
// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");
import java.util.Arrays;
import java.lang.Math;
class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
        Arrays.sort(A);
        int res = A[0] * A[1] * A[2];
        res = Math.max(res, A[0] * A[1] *A[A.length-1]);
        res = Math.max(res, A[0] * A[A.length-1] *A[A.length-2]);
        res = Math.max(res, A[A.length-3] * A[A.length-1] *A[A.length-2]);
        return res;                
    }
}


https://codility.com/demo/results/trainingHWDPP7-ZXQ/

Codility---MaxProductOfThree

标签:expec   UI   data-   des   int   time   import   val   out   

原文地址:http://www.cnblogs.com/samo/p/6784422.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!