1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 23:11:41 +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": true,
"difficulty": "Hard",
"likes": 282,
"dislikes": 135,
"likes": 285,
"dislikes": 137,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "5\n[[0,2],[0,3],[1,2],[1,3],[1,4],[2,4]]\n[\"ATL\",\"PEK\",\"LAX\",\"DXB\",\"HND\"]\n[\"ATL\",\"DXB\",\"HND\",\"LAX\"]\n4\n[[1,0],[2,0],[3,0],[2,1],[3,1],[3,2]]\n[\"ATL\",\"PEK\",\"LAX\",\"DXB\"]\n[\"ABC\",\"DEF\",\"GHI\",\"JKL\",\"MNO\",\"PQR\",\"STU\",\"VWX\"]\n6\n[[0,1],[1,2],[2,3],[3,4],[4,5]]\n[\"ATL\",\"PEK\",\"LAX\",\"ATL\",\"DXB\",\"HND\"]\n[\"ATL\",\"DXB\",\"HND\",\"DXB\",\"ATL\",\"LAX\",\"PEK\"]",
@@ -34,7 +34,7 @@
],
"companyTagStats": null,
"codeSnippets": null,
"stats": "{\"totalAccepted\": \"13.2K\", \"totalSubmission\": \"23.2K\", \"totalAcceptedRaw\": 13234, \"totalSubmissionRaw\": 23192, \"acRate\": \"57.1%\"}",
"stats": "{\"totalAccepted\": \"13.4K\", \"totalSubmission\": \"23.6K\", \"totalAcceptedRaw\": 13419, \"totalSubmissionRaw\": 23585, \"acRate\": \"56.9%\"}",
"hints": [
"Create an array dp where dp[i][j] is the min edit distance for the path starting at node i and compared to index j of the targetPath.",
"Traverse the dp array to obtain a valid answer."