1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
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

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 3197,
"dislikes": 159,
"likes": 3308,
"dislikes": 162,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[\"a\",\"b\",\"ba\",\"bca\",\"bda\",\"bdca\"]\n[\"xbc\",\"pcxbcf\",\"xb\",\"cxbc\",\"pcxbc\"]\n[\"abcd\",\"dbqca\"]",
@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"192.1K\", \"totalSubmission\": \"332.6K\", \"totalAcceptedRaw\": 192078, \"totalSubmissionRaw\": 332593, \"acRate\": \"57.8%\"}",
"stats": "{\"totalAccepted\": \"197.4K\", \"totalSubmission\": \"341.5K\", \"totalAcceptedRaw\": 197400, \"totalSubmissionRaw\": 341483, \"acRate\": \"57.8%\"}",
"hints": [
"Instead of adding a character, try deleting a character to form a chain in reverse.",
"For each word in order of length, for each word2 which is word with one character removed, length[word2] = max(length[word2], length[word] + 1)."