leetcode1039专题

LeetCode1039. Minimum Score Triangulation of Polygon——区间dp

文章目录 一、题目二、题解 一、题目 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 ith vertex (i.e., clock