mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-10 18:01:41 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 807,
|
||||
"dislikes": 647,
|
||||
"likes": 825,
|
||||
"dislikes": 650,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "3\n[[1,2],[2,3],[3,1]]\n4\n[[1,2],[3,4]]\n4\n[[1,2],[2,3],[3,4],[4,1],[1,3],[2,4]]",
|
||||
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"53.8K\", \"totalSubmission\": \"108K\", \"totalAcceptedRaw\": 53764, \"totalSubmissionRaw\": 107998, \"acRate\": \"49.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"54.7K\", \"totalSubmission\": \"109.7K\", \"totalAcceptedRaw\": 54728, \"totalSubmissionRaw\": 109718, \"acRate\": \"49.9%\"}",
|
||||
"hints": [
|
||||
"Since each garden is connected to at most 3 gardens, there's always an available color for each garden. For example, if one garden is next to gardens with colors 1, 3, 4, then color #2 is available."
|
||||
],
|
||||
|
Reference in New Issue
Block a user