@YipCubed/

# leet-missing-number

## No description

Files
• main.cpp
main.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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
```
```#include <cstring>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>

using namespace std;

ostream& operator<<(ostream& os, const vector<int>& v) {
os << "[";
for (int i : v) {
os << i << " ";
}
os << "]";
return os;
}

// Live coding problems, watch at
// https://www.twitch.tv/yipcubed
//

// makes code faster, but larger. Just for LeetCode fun!
#pragma GCC optimise ("Ofast")

// makes stdin not synced so it is faster. Just for LeetCode fun!
static auto x = [](){ios_base::sync_with_stdio(false); cin.tie(NULL); return NULL;}();

class Solution {
public:
int missingNumber(vector<int>& nums) {
int largest = nums.size();
bool largestFound = false;

for (int i = 0; i < nums.size(); ++i) {
// cout << "i: " << i << ", " << nums << endl;
if (nums[i] == i)
continue;
while (nums[i] != i && nums[i] != largest) {
swap(nums[i], nums[nums[i]]);
}
}
// cout << "at end nums: " << nums << endl;
for (int i = 0; i < nums.size(); ++i) {
if (i != nums[i])
return i;
}
return largest;
}
};

void test1() {
Solution S;
vector<int> v1{3,0,1};
cout << "2? " << S.missingNumber(v1) << endl;

vector<int> v2{9,6,4,2,3,5,7,0,1};
cout << "8? " << S.missingNumber(v2) << endl;
}

void test2() {
Solution S;
}

void test3() {
Solution S;
}

int main() {
test1();
test2();
test3();
cout << "Done!" << endl;

return 0;
}

```