update

leetcode-cn/originData/find-duplicate-subtrees.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一棵二叉树 <code>root</code>，返回所有<strong>重复的子树</strong>。</p>\n\n<p>对于同一类的重复子树，你只需要返回其中任意<strong>一棵</strong>的根结点即可。</p>\n\n<p>如果两棵树具有<strong>相同的结构</strong>和<strong>相同的结点值</strong>，则它们是<strong>重复</strong>的。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/08/16/e1.jpg\" style=\"height: 236px; width: 300px;\" /></p>\n\n<pre>\n<strong>输入：</strong>root = [1,2,3,4,null,2,4,null,null,4]\n<strong>输出：</strong>[[2,4],[4]]</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<p><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/08/16/e2.jpg\" style=\"height: 125px; width: 200px;\" /></p>\n\n<pre>\n<strong>输入：</strong>root = [2,1,1]\n<strong>输出：</strong>[[1]]</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<p><strong><img alt=\"\" src=\"https://assets.leetcode.com/uploads/2020/08/16/e33.jpg\" style=\"height: 202px; width: 300px;\" /></strong></p>\n\n<pre>\n<strong>输入：</strong>root = [2,2,2,3,null,3,null]\n<strong>输出：</strong>[[2,3],[3]]</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li>树中的结点数在<code>[1,10^4]</code>范围内。</li>\n\t<li><code>-200 &lt;= Node.val &lt;= 200</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 382,
+            "likes": 402,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Serialize and Deserialize Binary Tree\", \"titleSlug\": \"serialize-and-deserialize-binary-tree\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u4e8c\\u53c9\\u6811\\u7684\\u5e8f\\u5217\\u5316\\u4e0e\\u53cd\\u5e8f\\u5217\\u5316\"}, {\"title\": \"Serialize and Deserialize BST\", \"titleSlug\": \"serialize-and-deserialize-bst\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5e8f\\u5217\\u5316\\u548c\\u53cd\\u5e8f\\u5217\\u5316\\u4e8c\\u53c9\\u641c\\u7d22\\u6811\"}, {\"title\": \"Construct String from Binary Tree\", \"titleSlug\": \"construct-string-from-binary-tree\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u6839\\u636e\\u4e8c\\u53c9\\u6811\\u521b\\u5efa\\u5b57\\u7b26\\u4e32\"}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"45.1K\", \"totalSubmission\": \"78.2K\", \"totalAcceptedRaw\": 45062, \"totalSubmissionRaw\": 78245, \"acRate\": \"57.6%\"}",
+            "stats": "{\"totalAccepted\": \"48.4K\", \"totalSubmission\": \"83.6K\", \"totalAcceptedRaw\": 48444, \"totalSubmissionRaw\": 83624, \"acRate\": \"57.9%\"}",
             "hints": [],
             "solution": null,
             "status": null,