LRU cache miss - study code written in Java

LRU_cacheMiss_studycode.java

import java.util.*;
public class Solution {
    public static int countMiss(int[] input, int size)
    {
        List<Integer> list = new LinkedList<>();
        int count = 0;
        for(int i: input)
        {
            if(list.contains(i)) list.remove(new Integer(i));
            else
            {
                if(list.size() == size) list.remove(0);
                count++;
            }
            list.add(i);
        }
        return count;
    }
 
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int[] input = {1, 1, 3, 4, 5, 6, 1};
        System.out.println(countMiss(input, 4));
    }
}