-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q41.cpp
43 lines (36 loc) · 1.01 KB
/
Q41.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
36
37
38
39
40
41
42
43
#include<vector>
using namespace std;
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
if (nums.size() == 0) return 1;
vector<bool> records(nums.size(), false);
for (int i = 0; i<nums.size(); i++) {
if (nums[i] <= 0 || nums[i]>nums.size()) continue;
else records[nums[i] - 1] = true;
}
for (int i = 0; i<nums.size(); i++) {
if (records[i]) continue;
else return i + 1;
}
return nums.size() + 1;
}
int firstMissingPositive2(vector<int> &nums) {
if (nums.size() == 0) return 1;
for (decltype(nums.size()) i = 0; i < nums.size(); i++) {
while (nums[i] <= nums.size() && nums[i] > 0 && (nums[i] != nums[nums[i]-1])) {
swap(nums[i], nums[nums[i] - 1]);
}
}
for (decltype(nums.size()) i = 0; i < nums.size(); i++) {
if (nums[i]!=i+1) return int(i + 1);
}
return int(nums.size() + 1);
}
};
int main(void) {
vector<int> nums = { 1,1 };
Solution model;
int result = model.firstMissingPositive2(nums);
return 0;
}