Leetcode 缺失的第一个正整数

题目意思是找出第一个没出现的最小正整数。

Explanation:

  1. Move Numbers to Correct Positions:

    • The idea is to place each number in its corresponding index. For example, 1 should be at index 0, 2 should be at index 1, and so on. This is done using a while loop to swap the elements until all valid numbers (those within the range 1 to n) are in their respective positions.
  2. Find the First Missing Positive:

    • After the first step, iterate through the array. The first position where the element is not equal to i + 1 is the smallest missing positive integer.
  3. Return n + 1 if all numbers are in correct places:

    • If all numbers are in their correct places, the smallest missing positive integer must be n + 1.

Time Complexity:

  • The time complexity is O ( n ) O(n) O(n) because each element is swapped at most once.

Space Complexity:

  • The space complexity is O ( 1 ) O(1) O(1) since we are using constant extra space.
cpp 复制代码
class Solution {
public:
    int firstMissingPositive(vector<int>& nums) {
        int n = nums.size(); //由于数组下标是从0开始,所以值为 n 的元素的下标按顺序是 n - 1
        //例如1的下标是0,2的下标是1...
        for(int i = 0; i < n; i++) {
            //仅当当前元素值的范围介于[1,n]之间,并且它所该移动到的位置上的元素不相等时我们移动它到这个位置
            //值为 nums[i] 的元素按顺序排列的下标是 nums[i] - 1
            while(nums[i] > 0 && nums[i] <=n && nums[i] != nums[nums[i] - 1]) {
                swap(nums[i], nums[nums[i] - 1]);
            }
        }

        //然后,我们遍历数组,当下标 i 对应的值不等于 i + 1 时,返回 i + 1
        for(int i = 0; i < n; i++) {
            if(nums[i] != i + 1) {
                return i + 1;
            }
        }
        //如果在上面的循环中并没有return,说明数组所以元素值被排列成了 1,2,...,n
        return n + 1;
    }
};
相关推荐
杰克尼20 分钟前
1. 两数之和 (leetcode)
数据结构·算法·leetcode
YuTaoShao1 小时前
【LeetCode 热题 100】56. 合并区间——排序+遍历
java·算法·leetcode·职场和发展
JoJo_Way6 小时前
LeetCode三数之和-js题解
javascript·算法·leetcode
凌肖战8 小时前
力扣网C语言编程题:在数组中查找目标值位置之二分查找法
c语言·算法·leetcode
GEEK零零七10 小时前
Leetcode 1103. 分糖果 II
数学·算法·leetcode·等差数列
重庆小透明11 小时前
力扣刷题记录【1】146.LRU缓存
java·后端·学习·算法·leetcode·缓存
desssq12 小时前
力扣:70. 爬楼梯
算法·leetcode·职场和发展
岁忧13 小时前
(LeetCode 面试经典 150 题 ) 58. 最后一个单词的长度 (字符串)
java·c++·算法·leetcode·面试·go
??tobenewyorker16 小时前
力扣打卡第二十一天 中后遍历+中前遍历 构造二叉树
数据结构·c++·算法·leetcode
凌肖战18 小时前
力扣网C语言编程题:快慢指针来解决 “寻找重复数”
c语言·算法·leetcode