coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-21 13:06:47 +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/constrained-subsequence-sum.json
View File

@@ -167,7 +167,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"8.5K\", \"totalAcceptedRaw\": 3868, \"totalSubmissionRaw\": 8509, \"acRate\": \"45.5%\"}",
"stats": "{\"totalAccepted\": \"3.9K\", \"totalSubmission\": \"8.6K\", \"totalAcceptedRaw\": 3885, \"totalSubmissionRaw\": 8573, \"acRate\": \"45.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.",