3375. Minimum Operations to Make Array Values Equal to K - Easy
前往題目
想法
- 看有幾個
distinct value
就好,但不要包括k
思路
- 循環所有數字,紀錄有幾個
distinct
數字,不包含k
- 遇到小於
k
的就直接回傳-1
因為無法替換
Code
class Solution {
public int minOperations(int[] nums, int k) {
Set<Integer> res = new HashSet();
for (int num : nums) {
// k needs to be <= nums[i]
if (num < k) return -1;
// Add to the set except k
if (num != k) res.add(num);
}
return res.size();
}
}
3375. Minimum Operations to Make Array Values Equal to K - Easy
https://f88083.github.io/2025/04/09/3375-Minimum-Operations-to-Make-Array-Values-Equal-to-K-Easy/