g1

class Solution {
    public List<Integer> findSmallestSetOfVertices(int n, List<List<Integer>> edges) {
        List<Integer> l = new ArrayList<>();
        List<Integer> no = new ArrayList<>();
        for (int i = 0; i < edges.size(); ++i) {
            no.add(edges.get(i).get(1));
            int isThereInL = l.indexOf(edges.get(i).get(1));
            if (isThereInL != -1) {
                l.remove(isThereInL);
            }
            int curEdge = edges.get(i).get(0);
            if (l.indexOf(curEdge) != -1 || no.indexOf(curEdge) != -1) {
                continue;
            }
            l.add(curEdge);
        }
        return l;
    }
}