Shatteredxu#javaKI#2021-04-09__乘积最大子数组__有效数独1

### [152. 乘积最大子数组](https://leetcode-cn.com/problems/maximum-product-subarray/) ```java class Solution { public int maxProduct(int[] nums) { int n = nums.length; int max = nums[0]; int min = nums[0];//也可以用数组代替 int ans = nums[0]; for(int i=1;i