update

leetcode/originData/number-of-ways-to-reconstruct-a-tree.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Hard",
-            "likes": 114,
-            "dislikes": 88,
+            "likes": 119,
+            "dislikes": 91,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Create Binary Tree From Descriptions\", \"titleSlug\": \"create-binary-tree-from-descriptions\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[[1,2],[2,3]]\n[[1,2],[2,3],[1,3]]\n[[1,2],[2,3],[2,4],[1,5]]",
@@ -149,7 +149,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"5.7K\", \"totalAcceptedRaw\": 2404, \"totalSubmissionRaw\": 5705, \"acRate\": \"42.1%\"}",
+            "stats": "{\"totalAccepted\": \"2.4K\", \"totalSubmission\": \"5.8K\", \"totalAcceptedRaw\": 2432, \"totalSubmissionRaw\": 5771, \"acRate\": \"42.1%\"}",
             "hints": [
                 "Think inductively. The first step is to get the root. Obviously, the root should be in pairs with all the nodes. If there isn't exactly one such node, then there are 0 ways.",
                 "The number of pairs involving a node must be less than or equal to that number of its parent.",