leetcode - 1887. Reduction Operations to Make the Array Elements Equal

最新推荐文章于 2025-04-29 12:29:58 发布

KpLn_HJL

最新推荐文章于 2025-04-29 12:29:58 发布

阅读量177

点赞数

分类专栏： OJ题目记录文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/sinat_41679123/article/details/134489221

版权

OJ题目记录专栏收录该内容

576 篇文章

订阅专栏

Description

Given an integer array nums, your goal is to make all elements in nums equal. To complete one operation, follow these steps:

Find the largest value in nums. Let its index be i (0-indexed) and its value be largest. If there are multiple elements with the largest value, pick the smallest i.
Find the next largest value in nums strictly smaller than largest. Let its value be nextLargest.
Reduce nums[i] to nextLargest.
Return the number of operations to make all elements in nums equal.

Example 1:

Input: nums = [5,1,3]
Output: 3
Explanation: It takes 3 operations to make all elements in nums equal:
1. largest = 5 at index 0. nextLargest = 3. Reduce nums[0] to 3. nums = [3,1,3].
2. largest = 3 at index 0. nextLargest = 1. Reduce nums[0] to 1. nums = [1,1,3].
3. largest = 3 at index 2. nextLargest = 1. Reduce nums[2] to 1. nums = [1,1,1].

Example 2:

Input: nums = [1,1,1]
Output: 0
Explanation: All elements in nums are already equal.

Example 3:

Input: nums = [1,1,2,2,3]
Output: 4
Explanation: It takes 4 operations to make all elements in nums equal:
1. largest = 3 at index 4. nextLargest = 2. Reduce nums[4] to 2. nums = [1,1,2,2,2].
2. largest = 2 at index 2. nextLargest = 1. Reduce nums[2] to 1. nums = [1,1,1,2,2].
3. largest = 2 at index 3. nextLargest = 1. Reduce nums[3] to 1. nums = [1,1,1,1,2].
4. largest = 2 at index 4. nextLargest = 1. Reduce nums[4] to 1. nums = [1,1,1,1,1].

Constraints:

1 <= nums.length <= 5 * 10^4
1 <= nums[i] <= 5 * 10^4

Solution

Generate a frequency list of the nums, then sort it, from right to left add how many operations we need to perform

Time complexity: $o(n\log n)$
Space complexity: $o (n)$

Code

class Solution:
    def reductionOperations(self, nums: List[int]) -> int:
        num_cnt = {}
        for each_num in nums:
            num_cnt[each_num] = num_cnt.get(each_num, 0) + 1
        res = 0
        arr = sorted(num_cnt.items(), key=lambda x:x[0])
        for i in range(len(arr) - 1, 0, -1):
            res += i * arr[i][1]
        return res