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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/length-of-the-longest-subsequence-that-sums-to-target.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 115,
"dislikes": 17,
"likes": 149,
"dislikes": 20,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Coin Change\", \"titleSlug\": \"coin-change\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Coin Change II\", \"titleSlug\": \"coin-change-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,3,4,5]\n9\n[4,1,3,2,1,5]\n7\n[1,1,5,4,5]\n3",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"12.5K\", \"totalSubmission\": \"38.1K\", \"totalAcceptedRaw\": 12493, \"totalSubmissionRaw\": 38116, \"acRate\": \"32.8%\"}",
"stats": "{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 14573, \"totalSubmissionRaw\": 43441, \"acRate\": \"33.5%\"}",
"hints": [
"Use dynamic programming.",
"Let <code>dp[i][j]</code> be the maximum length of any subsequence of <code>nums[0..i - 1]</code> that sums to <code>j</code>.",