题解 | #缺失的第一个正整数#

class Solution {
  public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param nums int整型vector
     * @return int整型
     */
    int minNumberDisappeared(vector<int>& nums) {
        map<int, int> mapA;
        int minN = INT_MAX;
        int maxN = INT_MIN;
        for (auto i : nums) {
            maxN = max(i, maxN);
            minN = min(i, minN);
            mapA[i]++;
        }
        for (int i = 1; i <= maxN; i++) {
            if (mapA[i] <= 0 && i > 0) {
                return i;
            }
        }
        return maxN + 1 > 0 ? maxN + 1 : 1;
    }
};