package leetcode;

/**
 * https://leetcode.com/problems/minimum-score-triangulation-of-polygon/
 */
public class Problem1039 {
    public int minScoreTriangulation(int[] A) {
        // TODO
        return 0;
    }

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

@@ -300,16 +300,465 @@
 1039();%0A
+        System.out.println(prob.minScoreTriangulation(new int%5B%5D%7B1, 2, 3%7D)); // 6%0A        System.out.println(prob.minScoreTriangulation(new int%5B%5D%7B3, 7, 4, 5%7D)); // 144%0A        System.out.println(prob.minScoreTriangulation(new int%5B%5D%7B1, 3, 1, 4, 1, 5%7D)); // 13%0A        System.out.println(prob.minScoreTriangulation(new int%5B%5D%7B1, 3, 1, 4, 1, 5, 6%7D)); // 43%0A        System.out.println(prob.minScoreTriangulation(new int%5B%5D%7B1, 3, 1, 4, 1, 5, 6, 8%7D)); // 91%0A
     %7D%0A%7D%0A

Update problem 1039