-
Notifications
You must be signed in to change notification settings - Fork 0
/
ques_41.cpp
35 lines (30 loc) · 893 Bytes
/
ques_41.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
// Marking all negative and zero values as size of array
for(int i=0;i<nums.size();i++)
{
if(nums[i]<=0 || nums[i]>=nums.size()+1) nums[i] = nums.size()+1;
}
// Marking all the elements of found indexes as negative
for(int i=0;i<nums.size();i++)
{
int s = abs(nums[i]);
if(s==nums.size()+1)
{
continue;
}
int seat = s-1;
if(nums[seat]>0)
{
nums[seat] = nums[seat] * -1;
}
}
// If any index element is positive means that index+1 is missing positive number
for(int i=0;i<nums.size();i++)
{
if(nums[i]>0) return i+1;
}
return nums.size()+1;
}
};