coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-12-18 18:14:59 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/[no content]minimum-window-subsequence.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"4K\", \"totalSubmission\": \"9.9K\", \"totalAcceptedRaw\": 4021, \"totalSubmissionRaw\": 9873, \"acRate\": \"40.7%\"}",
"stats": "{\"totalAccepted\": \"4.2K\", \"totalSubmission\": \"10.2K\", \"totalAcceptedRaw\": 4195, \"totalSubmissionRaw\": 10248, \"acRate\": \"40.9%\"}",
"hints": [
"Let dp[j][e] = s be the largest index for which S[s:e+1] has T[:j] as a substring."
],