blob: 88557d44f7a060cd74bfd13ca0aeb5371d6b9fa1 (
plain)
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
|
/*
Challenge 201
Task 1: Missing Numbers
Submitted by: Mohammad S Anwar
You are given an array of unique numbers.
Write a script to find out all missing numbers in the range 0..$n where $n
is the array size.
Example 1
Input: @array = (0,1,3)
Output: 2
The array size i.e. total element count is 3, so the range is 0..3.
The missing number is 2 in the given array.
Example 2
Input: @array = (0,1)
Output: 2
The array size is 2, therefore the range is 0..2.
The missing number is 2.
*/
#include <algorithm>
#include <iostream>
#include <vector>
void print_missing(std::vector<int>& nums) {
std::sort(nums.begin(), nums.end());
for (size_t i = 0; i <= nums.size(); i++) { // check 0..N
if (!std::binary_search(nums.begin(), nums.end(), i))
std::cout << i << " ";
}
std::cout << std::endl;
}
int main(int argc, char* argv[]) {
argv++; argc--;
if (argc == 0) {
std::cerr << "usage: ch-1 nums..." << std::endl;
exit(EXIT_FAILURE);
}
std::vector<int> nums;
for (int i = 0; i < argc; i++)
nums.push_back(atoi(argv[i]));
print_missing(nums);
}
|
