力扣第三十三天(DP topic)

最新推荐文章于 2024-10-03 21:46:55 发布

NP_hard

最新推荐文章于 2024-10-03 21:46:55 发布

阅读量535

点赞数

分类专栏： LeetCode Learning 文章标签： leetcode 算法哈希算法

本文链接：https://blog.csdn.net/np_hard/article/details/123123493

版权

LeetCode Learning 专栏收录该内容

60 篇文章 0 订阅

订阅专栏

本文介绍了两个与数组处理相关的问题：152. 最大乘积子数组和1567. 正数子数组最长长度。针对这两个问题，分别给出了解决方案。最大乘积子数组问题中，算法通过遍历数组两次，分别计算正负数子数组的最大乘积，确保答案不会因负数而变小。正数子数组最长长度问题则关注连续子数组中正负数的交替，记录正数连续子数组的长度，并更新最大长度。两种方法的时间复杂度均为O(n)，空间复杂度为O(1)。

摘要由CSDN通过智能技术生成

problem Ⅰ

152. Maximum Product Subarray
Given an integer array nums, find a contiguous non-empty subarray within the array that has the largest product, and return the product.

The test cases are generated so that the answer will fit in a 32-bit integer.

A subarray is a contiguous subsequence of the array.

Example 1:

Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.

Example 2:

Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.

solution

class Solution {
public:
    int maxProduct(vector<int>& nums) {
        int res = 1, maxs = INT_MIN;
        for(auto i : nums){
            res *= i;
            if(res > maxs) maxs = res;
            if(i == 0) res = 1;
        }
        res = 1;
        for(int i=nums.size()-1; i>=0; i--){
            res *= nums[i];
            if(res > maxs) maxs = res;
            if(nums[i] == 0) res = 1;
        }
        return maxs;
    }
};

NOTE :
l didn’t come up with the solution of this problem at first, but now i got it.

let’s started with the problem without “zeros”

and then we can divide this problem into several situations

without negative element
- we can directly return the product of all element
with negative element
- even numbers
  - we can directly return the product of all element
- odd numbers
  - we have to remove an negative numbers

so how can we do it?

在这里插入图片描述
what we have to do is to remove the negative number at first / last, just like the illustration above, if we remove the mid, we got 1 and 2, if we remove the first or last, we get 3 and 4, it’s obviously that 3 and 4 is bigger than 1 and 2

and then we compare 3 and 4, choose the one bigger as answer

time complexity : $O (n)$
space complexity : $O (1)$

problem Ⅱ

1567. Maximum Length of Subarray With Positive Product
Given an array of integers nums, find the maximum length of a subarray where the product of all its elements is positive.

A subarray of an array is a consecutive sequence of zero or more values taken out of that array.

Return the maximum length of a subarray with positive product.

Example 1:

Input: nums = [1,-2,-3,4]
Output: 4
Explanation: The array nums already has a positive product of 24.

Example 2:

Input: nums = [0,1,-2,-3,-4]
Output: 3
Explanation: The longest subarray with positive product is [1,-2,-3] which has a product of 6.
Notice that we cannot include 0 in the subarray since that'll make the product 0 which is not positive.

Example 3:

Input: nums = [-1,-2,-3,0,1]
Output: 2
Explanation: The longest subarray with positive product is [-1,-2] or [-2,-3].

solution

class Solution {
public:
    int getMaxLen(vector<int>& nums) {
        int res = 1, lens=0, maxs = 0;
        for(auto i : nums){
            if(i == 0){
                res = 1, lens = 0;
            }else{
                res *= (i < 0)?-1:1;
                ++lens;
                if(res > 0 && lens > maxs) maxs = lens;
            }
        }
        res = 1, lens = 0;
        for(int i=nums.size()-1; i>=0; i--){
            if(nums[i] == 0){
                res = 1, lens = 0;
            }else{
                res *= (nums[i] < 0)?-1:1;
                ++lens;
                if(res > 0 && lens > maxs) maxs = lens;
            }
        }
        return maxs;
    }
};