coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-07 00:11: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/length-of-the-longest-subsequence-that-sums-to-target.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"43.4K\", \"totalAcceptedRaw\": 14573, \"totalSubmissionRaw\": 43441, \"acRate\": \"33.5%\"}",
"stats": "{\"totalAccepted\": \"14.6K\", \"totalSubmission\": \"43.5K\", \"totalAcceptedRaw\": 14590, \"totalSubmissionRaw\": 43471, \"acRate\": \"33.6%\"}",
"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>.",