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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"43.9K\", \"totalSubmission\": \"75.5K\", \"totalAcceptedRaw\": 43892, \"totalSubmissionRaw\": 75536, \"acRate\": \"58.1%\"}",
"stats": "{\"totalAccepted\": \"43.9K\", \"totalSubmission\": \"75.5K\", \"totalAcceptedRaw\": 43897, \"totalSubmissionRaw\": 75544, \"acRate\": \"58.1%\"}",
"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]."
],