Package g2501_2600.s2518_number_of_great_partitions

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2518 - Number of Great Partitions\.

    Hard

    You are given an array nums consisting of positive integers and an integer k.

    Partition the array into two ordered groups such that each element is in exactly one group. A partition is called great if the sum of elements of each group is greater than or equal to k.

    Return the number of distinct great partitions. Since the answer may be too large, return it modulo <code>10<sup>9</sup> + 7</code>.

    Two partitions are considered distinct if some element nums[i] is in different groups in the two partitions.

    Example 1:

    Input: nums = 1,2,3,4, k = 4

    Output: 6

    Explanation: The great partitions are: (1,2,3, 4), (1,3, 2,4), (1,4, 2,3), (2,3, 1,4), (2,4, 1,3) and (4, 1,2,3).

    Example 2:

    Input: nums = 3,3,3, k = 4

    Output: 0

    Explanation: There are no great partitions for this array.

    Example 3:

    Input: nums = 6,6, k = 2

    Output: 2

    Explanation: We can either put nums0 in the first partition or in the second partition. The great partitions will be (6, 6) and (6, 6).

    Constraints:

    • 1 &lt;= nums.length, k &lt;= 1000

    • <code>1 <= 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 countPartitions(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

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