LeetCode: Maximum Product Subarray

很久没练只能看别人代码了

 1 class Solution {
 2 public:
 3     int maxProduct(int A[], int n) {
 4         if (n == 0) return 0;
 5         int curMax, curMin, ans;
 6         ans = curMax = curMin = A[0];
 7         for (int i = 1; i < n; ++i) {
 8             int tmp = curMin*A[i];
 9             curMin = min(A[i], min(tmp, curMax*A[i]));
10             curMax = max(A[i], max(tmp, curMax*A[i]));
11             ans = max(ans, curMax);
12         }
13         return ans;
14     }
15 };

 1 public class Solution {
 2     public int MaxProduct(int[] nums) {
 3         if (nums.Length == 0) return 0;
 4         int curMax = nums[0], curMin = nums[0], ans = nums[0];
 5         for (int i = 1; i < nums.Length; i++) {
 6             int tmp = curMin * nums[i];
 7             curMin = Math.Min(nums[i], Math.Min(tmp, curMax * nums[i]));
 8             curMax = Math.Max(nums[i], Math.Max(tmp, curMax * nums[i]));
 9             ans = Math.Max(ans, curMax);
10         }
11         return ans;
12     }
13 }

View Code

转载于:https://www.cnblogs.com/yingzhongwen/p/4012148.html

LeetCode: Maximum Product Subarray相关推荐

LeetCode Maximum Product Subarray(最大子数组乘积)
Find the contiguous subarray within an array (containing at least one number) which has the large ...
LeetCode Maximum Product Subarray 解题报告
LeetCode 新题又更新了.求:最大子数组乘积. https://oj.leetcode.com/problems/maximum-product-subarray/ 题目分析:求一个数组,连续子 ...
【LeetCode】Maximum Product Subarray 求连续子数组使其乘积最大
Add Date 2014-09-23 Maximum Product Subarray Find the contiguous subarray within an array (containin ...
LeetCode 152. Maximum Product Subarray
152. Maximum Product Subarray Find the contiguous subarray within an array (containing at least one ...
【LeetCode】152. Maximum Product Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the larg ...
LeetCode Maximum Product of Word Lengths(位操作)
问题:给出一个字符串数组,要求求出两个没有共同字符的字符串的最大积思路:第一种方法是直接枚举任意两个字符串,看是否有公共字符,如果没有,则计算乘积,并更新最大值. 第二种方法,因为字符范围是a-z, ...
Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest ...
leetcode 152. Maximum Product Subarray | 152. 乘积最大子数组（Java）
题目 https://leetcode.com/problems/maximum-product-subarray/ 题解 class Solution {public int maxProduct( ...
子数组的最大乘积 Maximum Product Subarray
为什么80%的码农都做不了架构师?>>> 问题: Find the contiguous subarray within an array (containing at lea ...

LeetCode: Maximum Product Subarray

LeetCode: Maximum Product Subarray相关推荐

最新文章

热门文章