LeetCode: Maximum Product Subarray

很久没练只能看别人代码了

class Solution {
public:
    int maxProduct(int A[], int n) {
        if (n == 0) return 0;
        int curMax, curMin, ans;
        ans = curMax = curMin = A[0];
        for (int i = 1; i < n; ++i) {
            int tmp = curMin*A[i];
            curMin = min(A[i], min(tmp, curMax*A[i]));
            curMax = max(A[i], max(tmp, curMax*A[i]));
            ans = max(ans, curMax);
        }
        return ans;
    }
};

 C#

public class Solution {
    public int MaxProduct(int[] nums) {
        if (nums.Length == 0) return 0;
        int curMax = nums[0], curMin = nums[0], ans = nums[0];
        for (int i = 1; i < nums.Length; i++) {
            int tmp = curMin * nums[i];
            curMin = Math.Min(nums[i], Math.Min(tmp, curMax * nums[i]));
            curMax = Math.Max(nums[i], Math.Max(tmp, curMax * nums[i]));
            ans = Math.Max(ans, curMax);
        }
        return ans;
    }
}