update

leetcode-cn/originData/binary-search.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给定一个&nbsp;<code>n</code>&nbsp;个元素有序的（升序）整型数组&nbsp;<code>nums</code> 和一个目标值&nbsp;<code>target</code> &nbsp;，写一个函数搜索&nbsp;<code>nums</code>&nbsp;中的 <code>target</code>，如果目标值存在返回下标，否则返回 <code>-1</code>。</p>\n\n<p><br>\n<strong>示例 1:</strong></p>\n\n<pre><strong>输入:</strong> <code>nums</code> = [-1,0,3,5,9,12], <code>target</code> = 9\n<strong>输出:</strong> 4\n<strong>解释:</strong> 9 出现在 <code>nums</code> 中并且下标为 4\n</pre>\n\n<p><strong>示例&nbsp;2:</strong></p>\n\n<pre><strong>输入:</strong> <code>nums</code> = [-1,0,3,5,9,12], <code>target</code> = 2\n<strong>输出:</strong> -1\n<strong>解释:</strong> 2 不存在 <code>nums</code> 中因此返回 -1\n</pre>\n\n<p>&nbsp;</p>\n\n<p><strong>提示：</strong></p>\n\n<ol>\n\t<li>你可以假设 <code>nums</code>&nbsp;中的所有元素是不重复的。</li>\n\t<li><code>n</code>&nbsp;将在&nbsp;<code>[1, 10000]</code>之间。</li>\n\t<li><code>nums</code>&nbsp;的每个元素都将在&nbsp;<code>[-9999, 9999]</code>之间。</li>\n</ol>\n",
             "isPaidOnly": false,
             "difficulty": "Easy",
-            "likes": 736,
+            "likes": 738,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Search in a Sorted Array of Unknown Size\", \"titleSlug\": \"search-in-a-sorted-array-of-unknown-size\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u641c\\u7d22\\u957f\\u5ea6\\u672a\\u77e5\\u7684\\u6709\\u5e8f\\u6570\\u7ec4\"}]",
@@ -143,7 +143,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"513.1K\", \"totalSubmission\": \"945.3K\", \"totalAcceptedRaw\": 513068, \"totalSubmissionRaw\": 945265, \"acRate\": \"54.3%\"}",
+            "stats": "{\"totalAccepted\": \"516.8K\", \"totalSubmission\": \"952.1K\", \"totalAcceptedRaw\": 516791, \"totalSubmissionRaw\": 952107, \"acRate\": \"54.3%\"}",
             "hints": [],
             "solution": null,
             "status": null,