public class Solution { public int maxProduct(int[] A) { //01:42 if(A.length == 0) return 0; if(A.length == 1) return A[0]; int maxLocal = A[0]; int minLocal = A[0]; int maxGlobal = A[0]; for(int i = 1; i < A.length; i++){ int maxCopy = maxLocal; maxLocal = Math.max(Math.max(A[i], A[i] * maxLocal), A[i] * minLocal); minLocal = Math.min(Math.min(A[i], A[i] * maxCopy), A[i] * minLocal); maxGlobal = Math.max(maxGlobal, maxLocal); } return maxGlobal; //01:47 } }