LeetCode 1856. Maximum Subarray Min-Product - 亚马逊高频题30

CP Coding

已于 2022-04-08 11:05:38 修改

阅读量541

点赞数 1

分类专栏： Leetcode刷题笔记亚马逊高频题单调栈(Monotonic Stack) 文章标签： leetcode 算法 python 数据结构单调栈

于 2022-04-08 11:05:29 首次发布

本文链接：https://blog.csdn.net/hgq522/article/details/124035064

版权

给定一个整数数组，找到具有最大最小乘积的非空子数组。利用单调栈求解，通过找到每个数的左侧和右侧下一个较小的数，计算子数组和，最终找到最大乘积。问题转化为求解每个数对应的最长增序列两端的元素，结合前缀和加速计算。

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

The min-product of an array is equal to the minimum value in the array multiplied by the array's sum.

For example, the array [3,2,5] (minimum value is 2) has a min-product of 2 * (3+2+5) = 2 * 10 = 20.

Given an array of integers nums, return the maximum min-product of any non-empty subarray of nums. Since the answer may be large, return it modulo 109 + 7.

Note that the min-product should be maximized before performing the modulo operation. Testcases are generated such that the maximum min-product without modulo will fit in a 64-bit signed integer.

A subarray is a contiguous part of an array.

Example 1: