【LeetCode】152.Maximum Product Subarray(Medium)解题报告
2018-01-31 11:11
483 查看
【LeetCode】152.Maximum Product Subarray(Medium)解题报告
题目地址:https://leetcode.com/problems/maximum-product-subarray/description/
题目描述:
Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest product = 6.
Solution:
Date:2018年1月31日
题目地址:https://leetcode.com/problems/maximum-product-subarray/description/
题目描述:
Find the contiguous subarray within an array (containing at least one number) which has the largest product.
For example, given the array [2,3,-2,4],the contiguous subarray [2,3] has the largest product = 6.
Solution:
//有很多种方法,暂时只看一种好理解的 //time:O(n) //space:O(1) //[2,3,-2,4] //max=2 min=2 res=2 //i=1 max=6 min=3 res=6 //i=2 max=-2 min=-12 res=6 //i=3 max=4 min=-48 res=6 class Solution { public int maxProduct(int[] nums) { if(nums == null || nums.length==0) return 0; //维护两个值,最大和最小 int max = nums[0]; int min = nums[0]; int res = nums[0]; for(int i=1 ; i<nums.length ; i++){ int temp = max; max = Math.max(Math.max(max*nums[i],min*nums[i]),nums[i]); min = Math.min(Math.min(temp*nums[i],min*nums[i]),nums[i]); res = Math.max(res,max); } return res; } }
Date:2018年1月31日
相关文章推荐
- 【LeetCode】238.Product of Array Except Self(Medium)解题报告
- LeetCode解题报告 199. Binary Tree Right Side View [medium]
- 【LeetCode】75.Sort Colors(Medium)解题报告
- 【LeetCode】285.Inorder Successor in BST(Medium)(带锁题)解题报告
- 【LeetCode】103. Binary Tree Zigzag Level Order Traversal(Medium)解题报告
- 【LeetCode】199.Binary Tree Right Side View(Medium)解题报告
- 【LeetCode】57.Insert Interval(Medium)解题报告
- 【LeetCode】275.H-Index II(Medium)解题报告
- 【LeetCode】280.Wiggle Sort (Medium)(带锁题)解题报告
- 【LeetCode】351.Android Unlock Patterns(Medium)解题报告
- 【LeetCode】60.Permutation Sequence(medium)解题报告
- 【LeetCode】94.Binary Tree Inorder Traversal(Medium)解题报告
- 【LeetCode】334.Increasing Triplet Subsequence(Medium)解题报告
- 【LeetCode】406.Queue Reconstruction by Height(Medium)解题报告
- 【LeetCode】337.House Robber III(Medium)解题报告
- 【LeetCode】244.Shortest Word Distance II(Medium)解题报告
- 【LeetCode】560.Subarray Sum Equals K(Medium)解题报告
- 【LeetCode】648.Replace Words(Medium)解题报告
- 【LeetCode】435.Non-overlapping Intervals(Medium)解题报告
- 【LeetCode】491.Increasing Subsequences(Medium)解题报告