coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-24 22:38:57 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 16:56:27 +08:00
parent e730aa6794
commit ad15da05aa
2517 changed files with 7358 additions and 7332 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"5.3K\", \"totalSubmission\": \"9.4K\", \"totalAcceptedRaw\": 5344, \"totalSubmissionRaw\": 9434, \"acRate\": \"56.6%\"}",
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"9.5K\", \"totalAcceptedRaw\": 5368, \"totalSubmissionRaw\": 9463, \"acRate\": \"56.7%\"}",
"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]."
],