update

leetcode-cn/originData/sorted-merge-lcci.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定两个排序后的数组 A 和 B，其中 A 的末端有足够的缓冲空间容纳 B。 编写一个方法，将 B 合并入 A 并排序。</p>\n\n<p>初始化&nbsp;A 和 B 的元素数量分别为&nbsp;<em>m</em> 和 <em>n</em>。</p>\n\n<p><strong>示例:</strong></p>\n\n<pre><strong>输入:</strong>\nA = [1,2,3,0,0,0], m = 3\nB = [2,5,6],       n = 3\n\n<strong>输出:</strong>&nbsp;[1,2,2,3,5,6]</pre>\n\n<p><strong>说明:</strong></p>\n\n<ul>\n\t<li><code>A.length == n + m</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 135,
+            "likes": 139,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -131,7 +131,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"64.1K\", \"totalSubmission\": \"114.7K\", \"totalAcceptedRaw\": 64051, \"totalSubmissionRaw\": 114692, \"acRate\": \"55.8%\"}",
+            "stats": "{\"totalAccepted\": \"65.3K\", \"totalSubmission\": \"116.8K\", \"totalAcceptedRaw\": 65309, \"totalSubmissionRaw\": 116804, \"acRate\": \"55.9%\"}",
             "hints": [
                 "尝试从数组的末端向前端移动。"
             ],