package leetcode;

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

/**
 * https://leetcode.com/problems/minimum-height-trees/
 */
public class Problem310 {
    public List<Integer> findMinHeightTrees(int n, int[][] edges) {
        List<Integer> result = new ArrayList<>();
        // TODO:
        return result;
    }

    public static void main(String[] args) {
        Problem310 prob = new Problem310();
    }
}

@@ -403,20 +403,423 @@
 oblem310();%0A
+        System.out.println(prob.findMinHeightTrees(4, new int%5B%5D%5B%5D%7B%0A            %7B1, 0%7D, %7B1, 2%7D, %7B1, 3%7D%0A        %7D)); // 1%0A        System.out.println(prob.findMinHeightTrees(6, new int%5B%5D%5B%5D%7B%0A            %7B0, 3%7D, %7B1, 3%7D, %7B2, 3%7D, %7B4, 3%7D, %7B5, 4%7D%0A        %7D)); // 3, 4%0A        System.out.println(prob.findMinHeightTrees(7, new int%5B%5D%5B%5D%7B%0A            %7B0, 3%7D, %7B1, 3%7D, %7B2, 3%7D, %7B4, 3%7D, %7B5, 4%7D, %7B0, 6%7D%0A        %7D)); // 3%0A
     %7D%0A%7D%0A

Update problem 310