628. Maximum Product of Three Numbers

问题描述：

  Given an integer array, find three numbers whose product is maximum and output the maximum product.

Example 1:
  Input: [1,2,3]
  Output: 6
Example 2:
  Input: [1,2,3,4]
  Output: 24
Note:

  The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
  Multiplication of any three numbers in the input won’t exceed the range of 32-bit signed integer.

此题使用brute force暴力解决的话会time exceeded

Solution1：Sorting(因为用到sort，Time complexity: O(nlogn), Space Complexity: O(logn))

class Solution {
    public int maximumProduct(int[] nums) {

        Arrays.sort(nums);
        //直接sort array ascending

        return Math.max(nums[nums.length - 1] *nums[0] *nums[1], nums[nums.length - 1]* nums[nums.length - 2]* nums[nums.length -3]);   
        //前一个statement是考虑到负数的情况

    }
}

Solution2【BEST】: Single Scan（TC: O(n), SC: O(1))

class Solution {
    public int maximumProduct(int[] nums) {
        //Lets find out the three largest numbers and two smallest number
        int max1 = Integer.MIN_VALUE, max2 = Integer.MIN_VALUE ,max3 = Integer.MIN_VALUE;

        int min1 = Integer.MAX_VALUE, min2 = Integer.MAX_VALUE;

        for(int n: nums){

            if( n > max1 ){

                max3 = max2;
                max2 = max1;
                max1 = n;

            }
            else if( n > max2 ){

                max3 = max2;
                max2 = n;
            }
            else if( n > max3 ){

                max3 = n;

            }

            if( n < min1 ){

                min2 = min1;
                min1 = n;
            }
            else if( n < min2 ){

                min2 = n;
            }
        }

         return Math.max(max1*max2*max3, min1*min2*max1);   

    }
}