@@ -0,0 +1,658 @@
+%22%22%22Leetcode 152. Maximum Product Subarray%0AMedium%0A%0AURL: https://leetcode.com/problems/maximum-product-subarray/%0A%0AGiven an integer array nums, find the contiguous subarray within an array%0A(containing at least one number) which has the largest product.%0A%0AExample 1:%0AInput: %5B2,3,-2,4%5D%0AOutput: 6%0AExplanation: %5B2,3%5D has the largest product 6.%0A%0AExample 2:%0AInput: %5B-2,0,-1%5D%0AOutput: 0%0AExplanation: The result cannot be 2, because %5B-2,-1%5D is not a subarray.%0A%22%22%22%0A%0Aclass Solution(object):%0A    def maxProduct(self, nums):%0A        %22%22%22%0A        :type nums: List%5Bint%5D%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0152_maximum_product_subarray.py