update

leetcode-cn/originData/intersection-of-two-arrays.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定两个数组&nbsp;<code>nums1</code>&nbsp;和&nbsp;<code>nums2</code> ，返回 <em>它们的交集</em>&nbsp;。输出结果中的每个元素一定是 <strong>唯一</strong> 的。我们可以 <strong>不考虑输出结果的顺序</strong> 。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums1 = [1,2,2,1], nums2 = [2,2]\n<strong>输出：</strong>[2]\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums1 = [4,9,5], nums2 = [9,4,9,8,4]\n<strong>输出：</strong>[9,4]\n<strong>解释：</strong>[4,9] 也是可通过的\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= nums1.length, nums2.length &lt;= 1000</code></li>\n\t<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 1000</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 513,
+            "likes": 514,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Intersection of Two Arrays II\", \"titleSlug\": \"intersection-of-two-arrays-ii\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e24\\u4e2a\\u6570\\u7ec4\\u7684\\u4ea4\\u96c6 II\"}, {\"title\": \"Intersection of Three Sorted Arrays\", \"titleSlug\": \"intersection-of-three-sorted-arrays\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e09\\u4e2a\\u6709\\u5e8f\\u6570\\u7ec4\\u7684\\u4ea4\\u96c6\"}]",
@@ -161,7 +161,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"274.8K\", \"totalSubmission\": \"371.6K\", \"totalAcceptedRaw\": 274759, \"totalSubmissionRaw\": 371572, \"acRate\": \"73.9%\"}",
+            "stats": "{\"totalAccepted\": \"275.8K\", \"totalSubmission\": \"372.9K\", \"totalAcceptedRaw\": 275806, \"totalSubmissionRaw\": 372936, \"acRate\": \"74.0%\"}",
             "hints": [],
             "solution": null,
             "status": null,