coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-08 00:41:42 +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/number-of-sets-of-k-non-overlapping-line-segments.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 9223, \"totalSubmissionRaw\": 21465, \"acRate\": \"43.0%\"}",
"stats": "{\"totalAccepted\": \"9.2K\", \"totalSubmission\": \"21.5K\", \"totalAcceptedRaw\": 9225, \"totalSubmissionRaw\": 21468, \"acRate\": \"43.0%\"}",
"hints": [
"Try to use dynamic programming where the current index and remaining number of line segments to form can describe any intermediate state.",
"To make the computation of each state in constant time, we could add another flag to the state that indicates whether or not we are in the middle of placing a line (placed start point but no endpoint)."