import java.util.ArrayDeque; import java.util.Queue; import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner scanner=new Scanner(System.in); int m=scanner.nextInt(); int n=scanner.nextInt(); Queue<Integer> queue=new ArrayDeque<>(); int count=0; for (int i = 0; i < n; i++) { int w=scanner.nextInt(); int flag=-1; for (Integer j : queue) { if(j==w) { flag=1; } } if(flag==-1) { if(queue.size()<m) { queue.add(w); }else { queue.poll(); queue.add(w); } count++; } } System.out.println(count); } }
这题主要是如何判断队列中是否有那个单词,我们可以采用增强for循环来解决该问题