java.lang.Object
g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference.Solution

public class Solution extends Object
2035 - Partition Array Into Two Arrays to Minimize Sum Difference.<p>Hard</p> <p>You are given an integer array <code>nums</code> of <code>2 * n</code> integers. You need to partition <code>nums</code> into <strong>two</strong> arrays of length <code>n</code> to <strong>minimize the absolute difference</strong> of the <strong>sums</strong> of the arrays. To partition <code>nums</code>, put each element of <code>nums</code> into <strong>one</strong> of the two arrays.</p> <p>Return <em>the <strong>minimum</strong> possible absolute difference</em>.</p> <p><strong>Example 1:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/10/02/ex1.png" alt="example-1" /></p> <p><strong>Input:</strong> nums = [3,9,7,3]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> One optimal partition is: [3,9] and [7,3]. The absolute difference between the sums of the arrays is abs((3 + 9) - (7 + 3)) = 2.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [-36,36]</p> <p><strong>Output:</strong> 72</p> <p><strong>Explanation:</strong> One optimal partition is: [-36] and [36]. The absolute difference between the sums of the arrays is abs((-36) - (36)) = 72.</p> <p><strong>Example 3:</strong></p> <p><img src="https://assets.leetcode.com/uploads/2021/10/02/ex3.png" alt="example-3" /></p> <p><strong>Input:</strong> nums = [2,-1,0,4,-2,-9]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> One optimal partition is: [2,4,-9] and [-1,0,-2]. The absolute difference between the sums of the arrays is abs((2 + 4 + -9) - (-1 + 0 + -2)) = 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= n <= 15</code></li> <li><code>nums.length == 2 * n</code></li> <li><code>-10<sup>7</sup> <= nums[i] <= 10<sup>7</sup></code></li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • minimumDifference

      public int minimumDifference(int[] nums)