maximum-strength-of-a-group

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed integer array <code>nums</code> representing the score of students in an exam. The teacher would like to form one non-empty group of students with maximal strength, where the strength of a group of students of indices <code>i0</code>, <code>i1</code>, <code>i2</code>, ... , <code>ik</code> is defined as <code>nums[i0] * nums[i1] * nums[i2] * ... * nums[ik​]</code>.

Return the maximum strength of a group the teacher can create.

&nbsp;
Example 1:

<pre>
Input: nums = [3,-1,-5,2,5,-9]
Output: 1350
Explanation: One way to form a group of maximal strength is to group the students at indices [0,2,3,4,5]. Their strength is 3 * (-5) * 2 * 5 * (-9) = 1350, which we can show is optimal.
</pre>

Example 2:

<pre>
Input: nums = [-4,-5,-4]
Output: 20
Explanation: Group the students at indices [0, 1] . Then, we&rsquo;ll have a resulting strength of 20. We cannot achieve greater strength.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 13</code></li>
	<li><code>-9 &lt;= nums[i] &lt;= 9</code></li>
</ul>

maxStrength

Maximum Strength of a Group

Maximum Strength of K Disjoint Subarrays

maximum-strength-of-k-disjoint-subarrays

K 个不相交子数组的最大能量值

Greedy

Bit Manipulation

Array

Dynamic Programming

Backtracking

Enumeration

Sorting

给你一个下标从 0&nbsp;开始的整数数组&nbsp;<code>nums</code>&nbsp;，它表示一个班级中所有学生在一次考试中的成绩。老师想选出一部分同学组成一个 非空&nbsp;小组，且这个小组的 实力值&nbsp;最大，如果这个小组里的学生下标为&nbsp;<code>i0</code>, <code>i1</code>, <code>i2</code>, ... , <code>ik</code>&nbsp;，那么这个小组的实力值定义为&nbsp;<code>nums[i0] * nums[i1] * nums[i2] * ... * nums[ik​]</code>&nbsp;。

请你返回老师创建的小组能得到的最大实力值为多少。

&nbsp;

示例 1：

<pre>输入：nums = [3,-1,-5,2,5,-9]
输出：1350
解释：一种构成最大实力值小组的方案是选择下标为 [0,2,3,4,5] 的学生。实力值为 3 * (-5) * 2 * 5 * (-9) = 1350 ，这是可以得到的最大实力值。
</pre>

示例 2：

<pre>输入：nums = [-4,-5,-4]
输出：20
解释：选择下标为 [0, 1] 的学生。得到的实力值为 20 。我们没法得到更大的实力值。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 13</code></li>
	<li><code>-9 &lt;= nums[i] &lt;= 9</code></li>
</ul>