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-cn/originData/constrained-subsequence-sum.json
View File

@@ -173,7 +173,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 7270, \"totalSubmissionRaw\": 15039, \"acRate\": \"48.3%\"}",
"stats": "{\"totalAccepted\": \"7.3K\", \"totalSubmission\": \"15K\", \"totalAcceptedRaw\": 7272, \"totalSubmissionRaw\": 15043, \"acRate\": \"48.3%\"}",
"hints": [
"Use dynamic programming.",
"Let dp[i] be the solution for the prefix of the array that ends at index i, if the element at index i is in the subsequence.",