created some comments

This commit is contained in:
ajitPc 2023-10-10 20:10:06 +05:30
parent f1e5957401
commit f97d07ebd3

View File

@ -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]