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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 969,
"likes": 972,
"dislikes": 110,
"isLiked": null,
"similarQuestions": "[]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"21.5K\", \"totalSubmission\": \"41K\", \"totalAcceptedRaw\": 21503, \"totalSubmissionRaw\": 41004, \"acRate\": \"52.4%\"}",
"stats": "{\"totalAccepted\": \"21.5K\", \"totalSubmission\": \"41.1K\", \"totalAcceptedRaw\": 21542, \"totalSubmissionRaw\": 41070, \"acRate\": \"52.5%\"}",
"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]."
],