1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-10-22 05:26:46 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -12,7 +12,7 @@
"translatedContent": "<p>给你一个未排序的整数数组 <code>nums</code> ,请你找出其中没有出现的最小的正整数。</p>\n请你实现时间复杂度为 <code>O(n)</code> 并且只使用常数级别额外空间的解决方案。\n\n<p> </p>\n\n<p><strong>示例 1</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [1,2,0]\n<strong>输出:</strong>3\n</pre>\n\n<p><strong>示例 2</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [3,4,-1,1]\n<strong>输出:</strong>2\n</pre>\n\n<p><strong>示例 3</strong></p>\n\n<pre>\n<strong>输入:</strong>nums = [7,8,9,11,12]\n<strong>输出:</strong>1\n</pre>\n\n<p> </p>\n\n<p><strong>提示:</strong></p>\n\n<ul>\n\t<li><code>1 <= nums.length <= 5 * 10<sup>5</sup></code></li>\n\t<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>\n</ul>\n",
"isPaidOnly": false,
"difficulty": "Hard",
"likes": 1420,
"likes": 1451,
"dislikes": 0,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Missing Number\", \"titleSlug\": \"missing-number\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e22\\u5931\\u7684\\u6570\\u5b57\"}, {\"title\": \"Find the Duplicate Number\", \"titleSlug\": \"find-the-duplicate-number\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5bfb\\u627e\\u91cd\\u590d\\u6570\"}, {\"title\": \"Find All Numbers Disappeared in an Array\", \"titleSlug\": \"find-all-numbers-disappeared-in-an-array\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u627e\\u5230\\u6240\\u6709\\u6570\\u7ec4\\u4e2d\\u6d88\\u5931\\u7684\\u6570\\u5b57\"}, {\"title\": \"Couples Holding Hands\", \"titleSlug\": \"couples-holding-hands\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u60c5\\u4fa3\\u7275\\u624b\"}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"206.6K\", \"totalSubmission\": \"488.1K\", \"totalAcceptedRaw\": 206616, \"totalSubmissionRaw\": 488064, \"acRate\": \"42.3%\"}",
"stats": "{\"totalAccepted\": \"216.6K\", \"totalSubmission\": \"509.5K\", \"totalAcceptedRaw\": 216562, \"totalSubmissionRaw\": 509460, \"acRate\": \"42.5%\"}",
"hints": [
"Think about how you would solve the problem in non-constant space. Can you apply that logic to the existing space?",
"We don't care about duplicates or non-positive integers",