Maximum Subarray With Equal Products
You are given an array of positive integers nums.
An array arr is called product equivalent if prod(arr) == lcm(arr) * gcd(arr), where:
prod(arr)is the product of all elements ofarr.gcd(arr)is the GCD of all elements ofarr.lcm(arr)is the LCM of all elements ofarr.
Return the length of the longest product equivalent subarray of nums.
Example 1
Input
nums = [1,2,1,2,1,1,1]Output
5The longest product equivalent subarray is [1, 2, 1, 1, 1], where its product is 2, its GCD is 1, and its LCM is 2.
Example 2
Input
nums = [2,3,4,5,6]Output
3The longest product equivalent subarray is [3, 4, 5].
Constraints
- 2 <= nums.length <= 100
- 1 <= nums[i] <= 10