coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/binary-tree-coloring-game.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 928,
"dislikes": 171,
"likes": 929,
"dislikes": 172,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,4,5,6,7,8,9,10,11]\n11\n3\n[1,2,3]\n3\n1",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"34K\", \"totalSubmission\": \"66.5K\", \"totalAcceptedRaw\": 34013, \"totalSubmissionRaw\": 66519, \"acRate\": \"51.1%\"}",
"stats": "{\"totalAccepted\": \"34.1K\", \"totalSubmission\": \"66.6K\", \"totalAcceptedRaw\": 34064, \"totalSubmissionRaw\": 66614, \"acRate\": \"51.1%\"}",
"hints": [
"The best move y must be immediately adjacent to x, since it locks out that subtree.",
"Can you count each of (up to) 3 different subtrees neighboring x?"