#2740
Find the Value of the Partition
specialist · 645 · lc medium +30 · verified · 64.8% accepted · 324 likes · top 68%
Description
Split positive integer array nums into two non-empty arrays nums1 and nums2. The partition value is |max(nums1) - min(nums2)|. Return the minimum achievable partition value.
Example 1:
Input: nums = [1,3,2,4]
Output: 1
Explanation: We can partition the array nums into nums1 = [1,2] and nums2 = [3,4].
- The maximum element of the array nums1 is equal to 2.
- The minimum element of the array nums2 is equal to 3.
The value of the partition is |2 - 3| = 1.
It can be proven that 1 is the minimum value out of all partitions.
Example 2:
Input: nums = [100,1,10]
Output: 9
Explanation: We can partition the array nums into nums1 = [10] and nums2 = [100,1].
- The maximum element of the array nums1 is equal to 10.
- The minimum element of the array nums2 is equal to 1.
The value of the partition is |10 - 1| = 9.
It can be proven that 9 is the minimum value out of all partitions.
Code
1
2
3