_1679.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.Map;

publicclass_1679 {
publicstaticclassSolution1 {
publicintmaxOperations(int[] nums, intk) {
Map<Integer, Integer> map = newHashMap<>();
intops = 0;
for (intnum : nums) {
if (map.containsKey(k - num)) {
map.put(k - num, map.get(k - num) - 1);
ops++;
if (map.get(k - num) == 0) {
map.remove(k - num);
 }
 } else {
map.put(num, map.getOrDefault(num, 0) + 1);
 }
 }
returnops;
 }
 }
}