Package g2501_2600.s2587_rearrange_array_to_maximize_prefix_score

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2587 - Rearrange Array to Maximize Prefix Score\.

    Medium

    You are given a 0-indexed integer array nums. You can rearrange the elements of nums to any order (including the given order).

    Let prefix be the array containing the prefix sums of nums after rearranging it. In other words, prefix[i] is the sum of the elements from 0 to i in nums after rearranging it. The score of nums is the number of positive integers in the array prefix.

    Return the maximum score you can achieve.

    Example 1:

    Input: nums = 2,-1,0,1,-3,3,-3

    Output: 6

    Explanation:

    We can rearrange the array into nums = 2,3,1,-1,-3,0,-3.

    prefix = 2,5,6,5,2,2,-1, so the score is 6.

    It can be shown that 6 is the maximum score we can obtain.

    Example 2:

    Input: nums = -2,-3,0

    Output: 0

    Explanation: Any rearrangement of the array will result in a score of 0.

    Constraints:

    • <code>1 <= nums.length <= 10<sup>5</sup></code>

    • <code>-10<sup>6</sup><= numsi<= 10<sup>6</sup></code>

    • 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 Integer maxScore(IntArray nums)

      • Methods inherited from class java.lang.Object

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