Package g2701_2800.s2708_maximum_strength_of_a_group

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2708 - Maximum Strength of a Group.

    Medium

    You are given a 0-indexed integer array nums 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>i<sub>0</sub></code>, <code>i<sub>1</sub></code>, <code>i<sub>2</sub></code>, ... , <code>i<sub>k</sub></code> is defined as <code>numsi<sub>0</sub> * numsi<sub>1</sub> * numsi<sub>2</sub> * ... * numsi<sub>k</sub></code>.

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

    Example 1:

    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.

    Example 2:

    Input: nums = -4,-5,-4

    Output: 20

    Explanation: Group the students at indices 0, 1 . Then, we’ll have a resulting strength of 20. We cannot achieve greater strength.

    Constraints:

    • 1 &lt;= nums.length &lt;= 13

    • -9 &lt;= nums[i] &lt;= 9

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long maxStrength(IntArray nums)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait