package leetcode;

import java.util.ArrayList;
import java.util.List;

/**
 * https://leetcode.com/problems/find-eventual-safe-states/
 */
public class Problem802 {
    public List<Integer> eventualSafeNodes(int[][] graph) {
        // TODO
        return new ArrayList<>();
    }

    public static void main(String[] args) {
        Problem802 prob = new Problem802();
        System.out.println(prob.eventualSafeNodes(new int[][]{
            {1, 2}, {2, 3}, {5}, {0}, {5}, {}, {}
        })); // [2,4,5,6]
    }
}

@@ -503,16 +503,124 @@
 ,4,5,6%5D%0A
+        System.out.println(prob.eventualSafeNodes(new int%5B%5D%5B%5D%7B%0A            %7B1,2%7D,%7B1%7D,%7B0%7D%0A        %7D)); // %5B%5D%0A
     %7D%0A%7D%0A

Update problem 802