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)

• [memory limit] 1 GB

• [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.

풀이

• 서로 붙어 있는 두 수의 곱 중, 최댓값을 구하는 문제
• 마지막 Index 만 주의하면 된다.

int solution(int[] inputArray) {
    int max = Integer.MIN_VALUE;
    
    for (int i = 0; i < inputArray.length - 1; i++) {
        if (max < inputArray[i] * inputArray[i + 1]) max = inputArray[i] * inputArray[i + 1];
    }
    
    return max;
}