aboutsummaryrefslogtreecommitdiff
path: root/challenge-080/adam-russell/cpp/ch-1.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'challenge-080/adam-russell/cpp/ch-1.cpp')
-rw-r--r--challenge-080/adam-russell/cpp/ch-1.cpp25
1 files changed, 25 insertions, 0 deletions
diff --git a/challenge-080/adam-russell/cpp/ch-1.cpp b/challenge-080/adam-russell/cpp/ch-1.cpp
new file mode 100644
index 0000000000..c13f1c8c43
--- /dev/null
+++ b/challenge-080/adam-russell/cpp/ch-1.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+/*
+* You are given an unsorted list of integers @N.
+* Write a script to find out the smallest positive number missing.
+*/
+int least_missing(int n[]){
+ std::sort (n, n + 4);
+ std::vector<int> numbers (n, n + 4);
+ for(int i = n[0]; i < n[3]; i++){
+ std::vector<int>::iterator itr = std::find(numbers.begin(), numbers.end(), i);
+ if (itr == std::end(numbers)) {
+ if(i > 0)
+ return i;
+ }
+ }
+ return -1;
+}
+
+int main(int argc, char** argv){
+ int N[4] = {5, 2, -2, 0};
+ int i = least_missing(N);
+ std::cout << "the least positive missing number is " << i << std::endl;
+} \ No newline at end of file