coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-score-triangulation-of-polygon.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 972,
"dislikes": 110,
"likes": 995,
"dislikes": 113,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3]\n[3,7,4,5]\n[1,3,1,4,1,5]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.5K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 21542, \"totalSubmissionRaw\": 41070, \"acRate\": \"52.5%\"}",
"stats": "{\"totalAccepted\": \"22.2K\", \"totalSubmission\": \"42.4K\", \"totalAcceptedRaw\": 22211, \"totalSubmissionRaw\": 42359, \"acRate\": \"52.4%\"}",
"hints": [
"Without loss of generality, there is a triangle that uses adjacent vertices A[0] and A[N-1] (where N = A.length). Depending on your choice K of it, this breaks down the triangulation into two subproblems A[1:K] and A[K+1:N-1]."
],