#2602

Minimum Operations to Make All Array Elements Equal

expert · 1030 · lc medium +32 · verified · 38% accepted · 862 likes · top 17%

Description

You are given a positive integer array nums and a query array queries. For each queries[i], compute the minimum number of increment/decrement-by-1 operations needed to make every element of nums equal to queries[i]. The array resets to its original state after each query. Return the results array.

Example 1:

Input: nums = [3,1,6,8], queries = [1,5]

Output: [14,10]

Explanation: For the first query we can do the following operations:

- Decrease nums[0] 2 times, so that nums = [1,1,6,8].

- Decrease nums[2] 5 times, so that nums = [1,1,1,8].

- Decrease nums[3] 7 times, so that nums = [1,1,1,1].

So the total number of operations for the first query is 2 + 5 + 7 = 14.

For the second query we can do the following operations:

- Increase nums[0] 2 times, so that nums = [5,1,6,8].

- Increase nums[1] 4 times, so that nums = [5,5,6,8].

- Decrease nums[2] 1 time, so that nums = [5,5,5,8].

- Decrease nums[3] 3 times, so that nums = [5,5,5,5].

So the total number of operations for the second query is 2 + 4 + 1 + 3 = 10.

Example 2:

Input: nums = [2,9,6,3], queries = [10]

Output: [20]

Explanation: We can increase each value in the array to 10. The total number of operations will be 8 + 1 + 4 + 7 = 20.

Code

1

2

3

class Solution:
    def minOperations(self, nums: List[int], queries: List[int]) -> List[int]:

class Solution:
    def minOperations(self, nums: List[int], queries: List[int]) -> List[int]: