update

leetcode/originData/maximum-depth-of-n-ary-tree.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 1932,
-            "dislikes": 69,
+            "likes": 1964,
+            "dislikes": 70,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Maximum Depth of Binary Tree\", \"titleSlug\": \"maximum-depth-of-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"The Time When the Network Becomes Idle\", \"titleSlug\": \"the-time-when-the-network-becomes-idle\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "[1,null,3,2,4,null,5,6]\n[1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]",
@@ -125,7 +125,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"205.1K\", \"totalSubmission\": \"289.1K\", \"totalAcceptedRaw\": 205053, \"totalSubmissionRaw\": 289099, \"acRate\": \"70.9%\"}",
+            "stats": "{\"totalAccepted\": \"208.3K\", \"totalSubmission\": \"293.3K\", \"totalAcceptedRaw\": 208320, \"totalSubmissionRaw\": 293335, \"acRate\": \"71.0%\"}",
             "hints": [],
             "solution": {
                 "id": "576",