update

leetcode-cn/originData/shortest-unsorted-continuous-subarray.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整数数组 <code>nums</code> ，你需要找出一个 <strong>连续子数组</strong> ，如果对这个子数组进行升序排序，那么整个数组都会变为升序排序。</p>\n\n<p>请你找出符合题意的 <strong>最短</strong> 子数组，并输出它的长度。</p>\n\n<p> </p>\n\n<div class=\"original__bRMd\">\n<div>\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [2,6,4,8,10,9,15]\n<strong>输出：</strong>5\n<strong>解释：</strong>你只需要对 [6, 4, 8, 10, 9] 进行升序排序，那么整个表都会变为升序排序。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1,2,3,4]\n<strong>输出：</strong>0\n</pre>\n\n<p><strong>示例 3：</strong></p>\n\n<pre>\n<strong>输入：</strong>nums = [1]\n<strong>输出：</strong>0\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 10<sup>4</sup></code></li>\n\t<li><code>-10<sup>5</sup> <= nums[i] <= 10<sup>5</sup></code></li>\n</ul>\n\n<p> </p>\n\n<p><strong>进阶：</strong>你可以设计一个时间复杂度为 <code>O(n)</code> 的解决方案吗？</p>\n</div>\n</div>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 807,
+            "likes": 808,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[]",
@@ -167,7 +167,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"119.5K\", \"totalSubmission\": \"291.9K\", \"totalAcceptedRaw\": 119547, \"totalSubmissionRaw\": 291933, \"acRate\": \"41.0%\"}",
+            "stats": "{\"totalAccepted\": \"119.9K\", \"totalSubmission\": \"292.9K\", \"totalAcceptedRaw\": 119932, \"totalSubmissionRaw\": 292868, \"acRate\": \"41.0%\"}",
             "hints": [],
             "solution": null,
             "status": null,