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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
leetcode/originData/constrained-subsequence-sum.json
View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 758,
"likes": 759,
"dislikes": 31,
"isLiked": null,
"similarQuestions": "[]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"17.6K\", \"totalSubmission\": \"37.9K\", \"totalAcceptedRaw\": 17629, \"totalSubmissionRaw\": 37944, \"acRate\": \"46.5%\"}",
"stats": "{\"totalAccepted\": \"17.7K\", \"totalSubmission\": \"38K\", \"totalAcceptedRaw\": 17658, \"totalSubmissionRaw\": 37995, \"acRate\": \"46.5%\"}",
"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.",