mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 23:11:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 2410,
|
||||
"dislikes": 123,
|
||||
"likes": 2527,
|
||||
"dislikes": 124,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[[0,1],[1,0]]\n[[0,0,0],[1,1,0],[1,1,0]]\n[[1,0,0],[1,1,0],[1,1,0]]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"170.4K\", \"totalSubmission\": \"400.5K\", \"totalAcceptedRaw\": 170369, \"totalSubmissionRaw\": 400530, \"acRate\": \"42.5%\"}",
|
||||
"stats": "{\"totalAccepted\": \"180.9K\", \"totalSubmission\": \"424.3K\", \"totalAcceptedRaw\": 180925, \"totalSubmissionRaw\": 424257, \"acRate\": \"42.6%\"}",
|
||||
"hints": [
|
||||
"Do a breadth first search to find the shortest path."
|
||||
],
|
||||
|
Reference in New Issue
Block a user