[LeetCode] 1039. Minimum Score Triangulation of Polygon 多边形三角形化的最小得分

You have a convex n-sided polygon where each vertex has an integer value. You are given an integer array values where values[i] is the value of the it
posted @ 2021-02-22 08:23  Grandyang  阅读(480)  评论(0)  编辑  收藏  举报
Fork me on GitHub