mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 06:51:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": true,
|
||||
"difficulty": "Hard",
|
||||
"likes": 1209,
|
||||
"dislikes": 72,
|
||||
"likes": 1228,
|
||||
"dislikes": 74,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Minimum Window Substring\", \"titleSlug\": \"minimum-window-substring\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Longest Continuous Increasing Subsequence\", \"titleSlug\": \"longest-continuous-increasing-subsequence\", \"difficulty\": \"Easy\", \"translatedTitle\": null}]",
|
||||
"exampleTestcases": "\"abcdebdde\"\n\"bde\"\n\"jmeqksfrsdcmsiwvaovztaqenprpvnbstl\"\n\"u\"",
|
||||
@@ -40,7 +40,7 @@
|
||||
],
|
||||
"companyTagStats": null,
|
||||
"codeSnippets": null,
|
||||
"stats": "{\"totalAccepted\": \"75.4K\", \"totalSubmission\": \"175.9K\", \"totalAcceptedRaw\": 75406, \"totalSubmissionRaw\": 175906, \"acRate\": \"42.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"76.5K\", \"totalSubmission\": \"178.5K\", \"totalAcceptedRaw\": 76473, \"totalSubmissionRaw\": 178465, \"acRate\": \"42.9%\"}",
|
||||
"hints": [
|
||||
"Let dp[j][e] = s be the largest index for which S[s:e+1] has T[:j] as a substring."
|
||||
],
|
||||
|
Reference in New Issue
Block a user