coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 07:51: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/longest-increasing-subsequence-ii.json
View File

@@ -179,7 +179,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"20K\", \"totalAcceptedRaw\": 6219, \"totalSubmissionRaw\": 19996, \"acRate\": \"31.1%\"}",
"stats": "{\"totalAccepted\": \"6.2K\", \"totalSubmission\": \"20K\", \"totalAcceptedRaw\": 6219, \"totalSubmissionRaw\": 19997, \"acRate\": \"31.1%\"}",
"hints": [
"We can use dynamic programming. Let dp[i][val] be the answer using only the first i + 1 elements, and the last element in the subsequence is equal to val.",
"The only value that might change between dp[i - 1] and dp[i] are dp[i - 1][val] and dp[i][val].",