update

leetcode-cn/originData/search-insert-position.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。</p>\n\n<p>请必须使用时间复杂度为 <code>O(log n)</code> 的算法。</p>\n\n<p>&nbsp;</p>\n\n<p><strong>示例 1:</strong></p>\n\n<pre>\n<strong>输入:</strong> nums = [1,3,5,6], target = 5\n<strong>输出:</strong> 2\n</pre>\n\n<p><strong>示例&nbsp;2:</strong></p>\n\n<pre>\n<strong>输入:</strong> nums = [1,3,5,6], target = 2\n<strong>输出:</strong> 1\n</pre>\n\n<p><strong>示例 3:</strong></p>\n\n<pre>\n<strong>输入:</strong> nums = [1,3,5,6], target = 7\n<strong>输出:</strong> 4\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 &lt;= nums.length &lt;= 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>4</sup> &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>\n\t<li><code>nums</code> 为&nbsp;<strong>无重复元素&nbsp;</strong>的&nbsp;<strong>升序&nbsp;</strong>排列数组</li>\n\t<li><code>-10<sup>4</sup> &lt;= target &lt;= 10<sup>4</sup></code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 1440,
+            "likes": 1443,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"First Bad Version\", \"titleSlug\": \"first-bad-version\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u7b2c\\u4e00\\u4e2a\\u9519\\u8bef\\u7684\\u7248\\u672c\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"724.8K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 724784, \"totalSubmissionRaw\": 1595202, \"acRate\": \"45.4%\"}",
+            "stats": "{\"totalAccepted\": \"727.8K\", \"totalSubmission\": \"1.6M\", \"totalAcceptedRaw\": 727810, \"totalSubmissionRaw\": 1602093, \"acRate\": \"45.4%\"}",
             "hints": [],
             "solution": null,
             "status": null,