PTA甲级 1144 The Missing Number (C++)

最新推荐文章于 2023-02-06 14:04:20 发布

负反馈循环

最新推荐文章于 2023-02-06 14:04:20 发布

阅读量74

点赞数

分类专栏： PTA 文章标签： c++ oj系统

本文链接：https://blog.csdn.net/qq_43659183/article/details/119992664

版权

PTA 专栏收录该内容

148 篇文章 2 订阅

订阅专栏

本文介绍了解决LeetCode问题中如何找到给定整数列表中缺失的最小正整数。通过输入样例10和5-25961342517，展示了如何使用C++代码实现并查找缺失的数字7。涉及的数据结构、查找算法和代码优化技巧。

摘要由CSDN通过智能技术生成

Given N integers, you are supposed to find the smallest positive integer that is NOT in the given list.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer $N (≤10^5)$ . Then $N$ integers are given in the next line, separated by spaces. All the numbers are in the range of int.

Output Specification:

Print in a line the smallest positive integer that is missing from the input list.

Sample Input:

10
5 -25 9 6 1 3 4 2 5 17

Sample Output:

Caution:

leetcode原题。

Solution:

// Talk is cheap, show me the code
// Created by Misdirection 2021-08-30 10:40:30
// All rights reserved.

#include <iostream>
#include <vector>

using namespace std;

int main(){
    int n;
    scanf("%d", &n);

    vector<int> nums(n + 1);
    vector<bool> flags(n + 1, false);
    for(int i = 0; i < n; ++i){
        int tmp;
        scanf("%d", &tmp);

        if(tmp <= n && tmp >= 1 && flags[tmp] == true) tmp = -1;
        else if(tmp <= n && tmp >= 1 && flags[tmp] == false) flags[tmp] = true;

        nums[i + 1] = tmp;
    }

    for(int i = 1; i <= n; ++i){
        while(nums[i] <= n && nums[i] >= 1 && nums[i] != i) swap(nums[i], nums[nums[i]]);
    }

    for(int i = 1; i <= n; ++i){
        if(nums[i] != i){
            printf("%d\n", i);
            return 0;
        }
    }

    printf("%d\n", n + 1);

    return 0;
}