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;
    }
};
相关推荐
共享家952710 小时前
栈相关算法题解题思路与代码实现分享
c++·leetcode
Wendy_robot10 小时前
【前缀和计算和+哈希表查找次数】Leetcode 560. 和为 K 的子数组
c++·算法·leetcode
o独酌o10 小时前
算法习题-力扣446周赛题解
算法·leetcode
云格~11 小时前
Leetcode:1. 两数之和
数据结构·算法·leetcode
xxjiaz11 小时前
水果成篮--LeetCode
java·算法·leetcode·职场和发展
肥or胖12 小时前
【LeetCode 热题 100】链表 系列
算法·leetcode·链表
Y.O.U..12 小时前
力扣HOT100——102.二叉树层序遍历
数据结构·c++·算法·leetcode
雾月5513 小时前
LeetCode 1780 判断一个数字是否可以表示成三的幂的和
java·数据结构·算法·leetcode·职场和发展·idea
Demons_kirit1 天前
Leetcode 2845 题解
算法·leetcode·职场和发展