Package g0901_1000.s0915_partition_array_into_disjoint_intervals

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    915 - Partition Array into Disjoint Intervals.

    Medium

    Given an integer array nums, partition it into two (contiguous) subarrays left and right so that:

    • Every element in left is less than or equal to every element in right.

    • left and right are non-empty.

    • left has the smallest possible size.

    Return the length of left after such a partitioning.

    Test cases are generated such that partitioning exists.

    Example 1:

    Input: nums = 5,0,3,8,6

    Output: 3

    Explanation: left = 5,0,3, right = 8,6

    Example 2:

    Input: nums = 1,1,1,0,6,12

    Output: 4

    Explanation: left = 1,1,1,0, right = 6,12

    Constraints:

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

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

    • There is at least one valid answer for the given input.

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

      • Methods inherited from class java.lang.Object

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