From f97d07ebd361a06fcad521d300e0d8d5c8443c4f Mon Sep 17 00:00:00 2001 From: ajitPc Date: Tue, 10 Oct 2023 20:10:06 +0530 Subject: [PATCH] created some comments --- divide_and_conquer/MaximumProductSubarray.py | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/divide_and_conquer/MaximumProductSubarray.py b/divide_and_conquer/MaximumProductSubarray.py index 7f285a045..1a2fed8c6 100644 --- a/divide_and_conquer/MaximumProductSubarray.py +++ b/divide_and_conquer/MaximumProductSubarray.py @@ -1,3 +1,7 @@ +''' +Maximum Product Subarray +This algorithm finds the contiguous subarray within an array that has the largest product. +''' def maxProoductSubarray(nums, n): ans = nums[0]