HR자바 Java Dequeue

개요[ | ]

HR자바 Java Dequeue
해커랭크 Java
# 문제 비고
HR자바 Data Structures e
28 HR자바 Java 1D Array
29 HR자바 Java 2D Array
30 HR자바 Java Subarray
31 HR자바 Java Arraylist
32 HR자바 Java 1D Array (Part 2)
33 HR자바 Java List
34 HR자바 Java Map
35 HR자바 Java Stack
36 HR자바 Java Hashset
37 HR자바 Java Generics
38 HR자바 Java Comparator
39 HR자바 Java Sort
40 HR자바 Java Dequeue
41 HR자바 Java BitSet
42 HR자바 Java Priority Queue

import java.util.*;
public class test {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        Deque deque = new ArrayDeque<>();
        int n = in.nextInt();
        int m = in.nextInt();
        
        Set set = new HashSet<>();
        int max = 0;
        for(int i=0; i<n; i++) {
            int num = in.nextInt();
            deque.add(num);
            set.add(num);
            if( i < m-1 ) continue;
            int size = set.size();
            if( size > max ) max = size;
            int removed = (Integer) deque.remove();
            if( !deque.contains(removed) ) {
                set.remove(removed);
            }
        }
        System.out.println(max);
    }
}
문서 댓글 ({{ doc_comments.length }})
{{ comment.name }} {{ comment.created | snstime }}