coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01: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/video-stitching.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"64.4K\", \"totalSubmission\": \"126.1K\", \"totalAcceptedRaw\": 64356, \"totalSubmissionRaw\": 126079, \"acRate\": \"51.0%\"}",
"stats": "{\"totalAccepted\": \"64.4K\", \"totalSubmission\": \"126.1K\", \"totalAcceptedRaw\": 64385, \"totalSubmissionRaw\": 126126, \"acRate\": \"51.0%\"}",
"hints": [
"What if we sort the intervals? Considering the sorted intervals, how can we solve the problem with dynamic programming?",
"Let's consider a DP(pos, limit) where pos represents the position of the current interval we are gonna take the decision and limit is the current covered area from [0 - limit]. This DP returns the minimum number of taken intervals or infinite if it's not possible to cover the [0 - T] section."