题目来源:https://leetcode.com/problems/first-missing-positive/
问题描述
41. First Missing Positive
Hard
Given an unsorted integer array, find the smallest missing positive integer.
Example 1:
Input: [1,2,0]
Output: 3
Example 2:
Input: [3,4,-1,1]
Output: 2
Example 3:
Input: [7,8,9,11,12]
Output: 1
Note:
Your algorithm should run in O(n) time and uses constant extra space.
------------------------------------------------------------
题意
给定无序数列nums,求不在数列nums中的最小正整数。
------------------------------------------------------------
思路
遍历无序数列,求出无序数列中的最大值maxv并将数列转成HashSet。遍历从1到maxv的正整数,找到第一个不在HashSet中的正整数i,则返回i,否则返回maxv + 1. 注意一个特例,即数列最大值小于等于0,这是直接返回1,而不是返回maxv + 1.
------------------------------------------------------------
代码
class Solution {
public int firstMissingPositive(int[] nums) {
HashSet<Integer> set = new HashSet<Integer>();
int maxv = 0;
for (int i: nums)
{
maxv = i > maxv ? i : maxv;
set.add(i);
}
if (maxv < 1)
{
return 1;
}
for (int i = 1; i < maxv; i++)
{
if (!set.contains(i))
{
return i;
}
}
return maxv + 1;
}
}