Blogs Hub

Maximum Product of Three Numbers - Array - Easy - LeetCode - MiniTV

Maximum Product of Three Numbers - Array - Easy - LeetCode - मिनी टीवी

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.

public class Solution {
    public int MaximumProduct(int[] nums) {
        Array.Sort(nums);
        int prod=1;
        int len = nums.Length;
        if(len<=3){
            for(int i=0;i<len;i++){
                prod*=nums[i];
            }
        }
        else{
            prod = Math.Max(nums[0]*nums[1]*nums[len-1], 
                           nums[len-1]*nums[len-2]*nums[len-3]);
        }
        
        return prod;
    }
}

 


Time Complexity: O(nlogn)

Space Complexity: O(1)