Package g2501_2600.s2592_maximize_greatness_of_an_array

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2592 - Maximize Greatness of an Array\.

    Medium

    You are given a 0-indexed integer array nums. You are allowed to permute nums into a new array perm of your choosing.

    We define the greatness of nums be the number of indices 0 <= i < nums.length for which perm[i] > nums[i].

    Return the maximum possible greatness you can achieve after permuting nums.

    Example 1:

    Input: nums = 1,3,5,2,1,3,1

    Output: 4

    Explanation: One of the optimal rearrangements is perm = 2,5,1,3,3,1,1. At indices = 0, 1, 3, and 4, permi> numsi. Hence, we return 4.

    Example 2:

    Input: nums = 1,2,3,4

    Output: 3

    Explanation: We can prove the optimal perm is 2,3,4,1. At indices = 0, 1, and 2, permi> numsi. Hence, we return 3.

    Constraints:

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

    • <code>0 <= numsi<= 10<sup>9</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 maximizeGreatness(IntArray nums)

      • Methods inherited from class java.lang.Object

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