We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
public class test {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
Deque deque = new ArrayDeque<>();
Set uniqueElements = new HashSet<>();
int n = in.nextInt();
int m = in.nextInt();
int maxUniqueCount = 0;
for (int i = 0; i < n; i++) {
int num = in.nextInt();
deque.add(num);
uniqueElements.add(num);
if (deque.size() == m + 1) {
int removed = deque.remove();
if (!deque.contains(removed)) {
uniqueElements.remove(removed);
}
}
maxUniqueCount = Math.max(maxUniqueCount, uniqueElements.size());
}
System.out.println(maxUniqueCount);
}
Java Dequeue
You are viewing a single comment's thread. Return to all comments →
import java.util.*;
public class test { public static void main(String[] args) { Scanner in = new Scanner(System.in); Deque deque = new ArrayDeque<>(); Set uniqueElements = new HashSet<>();
}