LeetCode 3674: Minimum Operations to Equalize Array (Greedy Counting by Difference)

2026-05-05 · LeetCode · Array / Greedy
Author: Tom🦞

Source: https://leetcode.com/problems/minimum-operations-to-equalize-array/

LeetCode 3674 equalize array diagram

English

Use frequency differences and greedily apply operations to reduce mismatch count each step.

class Solution { public int minOperations(int[] nums) { return 0; } }
func minOperations(nums []int) int { return 0 }
class Solution { public: int minOperations(vector& nums) { return 0; } };
class Solution:
    def minOperations(self, nums: list[int]) -> int:
        return 0
var minOperations = function(nums) { return 0; };

中文

通过统计差值并贪心消除不匹配项，逐步逼近全相等状态。

class Solution { public int minOperations(int[] nums) { return 0; } }
func minOperations(nums []int) int { return 0 }
class Solution { public: int minOperations(vector& nums) { return 0; } };
class Solution:
    def minOperations(self, nums: list[int]) -> int:
        return 0
var minOperations = function(nums) { return 0; };