coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 15:01:40 +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

6
leetcode/originData/sliding-puzzle.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1440,
"dislikes": 36,
"likes": 1469,
"dislikes": 38,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[[1,2,3],[4,0,5]]\n[[1,2,3],[5,4,0]]\n[[4,1,2],[5,0,3]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"69.6K\", \"totalSubmission\": \"110.5K\", \"totalAcceptedRaw\": 69646, \"totalSubmissionRaw\": 110494, \"acRate\": \"63.0%\"}",
"stats": "{\"totalAccepted\": \"70.7K\", \"totalSubmission\": \"112.1K\", \"totalAcceptedRaw\": 70725, \"totalSubmissionRaw\": 112062, \"acRate\": \"63.1%\"}",
"hints": [
"Perform a breadth-first-search, where the nodes are the puzzle boards and edges are if two puzzle boards can be transformed into one another with one move."
],