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/[no content]minimum-window-subsequence.json
View File

@@ -40,7 +40,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6122, \"totalSubmissionRaw\": 14368, \"acRate\": \"42.6%\"}",
"stats": "{\"totalAccepted\": \"6.1K\", \"totalSubmission\": \"14.4K\", \"totalAcceptedRaw\": 6124, \"totalSubmissionRaw\": 14370, \"acRate\": \"42.6%\"}",
"hints": [
"Let dp[j][e] = s be the largest index for which S[s:e+1] has T[:j] as a substring."
],