动态规划-最大连续子序列积

给定一个数组，求取最大连续最大子序列积

 public static int MaxProduct(int[] nums)
        {
            int maxLocal = nums[0];
            int minLocal = nums[0];
            int global = nums[0];

            for (int i = 1; i < nums.Length; i++)
            {
                int temp = maxLocal;
                maxLocal = Math.Max(Math.Max(nums[i] * maxLocal, nums[i]), nums[i] * minLocal);
                minLocal = Math.Min(Math.Min(nums[i] * temp, nums[i]), nums[i] * minLocal);
                global = Math.Max(global, maxLocal);
            }
            return global;
        }