coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/longest-ideal-subsequence.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"59.4K\", \"totalAcceptedRaw\": 22262, \"totalSubmissionRaw\": 59368, \"acRate\": \"37.5%\"}",
"stats": "{\"totalAccepted\": \"22.3K\", \"totalSubmission\": \"59.4K\", \"totalAcceptedRaw\": 22268, \"totalSubmissionRaw\": 59378, \"acRate\": \"37.5%\"}",
"hints": [
"How can you calculate the longest ideal subsequence that ends at a specific index i?",
"Can you calculate it for all positions i? How can you use previously calculated answers to calculate the answer for the next position?"