Minimum Number of Operations to Make Arrays Similar
You are given two positive integer arrays nums and target, of the same length.
In one operation, you can choose any two distinct indices i and j where 0 <= i, j < nums.length and:
- Set
nums[i] = nums[i] + 2. - Set
nums[j] = nums[j] - 2.
Two arrays are considered to be similar if the frequency of each element is the same.
Return the minimum number of operations required to make nums similar to target. The test cases are generated such that nums can always be similar to target.
Example 1
Input
nums = [8,12,6], target = [2,14,10]Output
2It is possible to make nums similar to target in two operations, and 2 is the minimum number needed.
Example 2
Input
nums = [1,2,5], target = [4,1,3]Output
1Choosing i = 1 and j = 2 changes nums to [1,4,3], which is similar to target in one operation.
Constraints
- n == nums.length == target.length
- 1 <= n <= 10^5
- 1 <= nums[i], target[i] <= 10^6
- It is possible to make nums similar to target.