Given an array of integers, find the pair of adjacent elements that has the largest product and return that product.
Example
For inputArray = [3, 6, -2, -5, 7, 3], the output should be
solution(inputArray) = 21.
7 and 3 produce the largest product.
Input/Output
[execution time limit] 3 seconds (java)
[input] array.integer inputArray
An array of integers containing at least two elements.
Guaranteed constraints:
2 ≤ inputArray.length ≤ 10,
-1000 ≤ inputArray[i] ≤ 1000.
[output] integer
The largest product of adjacent elements
int solution(int[] inputArray) {
int len = inputArray.length;
int max = -10000;
for(int i=0; i<len-1; i++){
if(inputArray[i]*inputArray[i+1] > max){
max = inputArray[i]*inputArray[i+1];
}
}
return max;
}