From f6f0a4306d8843f5732536a95f3c61d8f3c2e300 Mon Sep 17 00:00:00 2001 From: Mohammad S Anwar Date: Sun, 4 Oct 2020 22:29:28 +0100 Subject: - Added solutions by Adam Russell. --- challenge-080/adam-russell/cpp/ch-1.cpp | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 challenge-080/adam-russell/cpp/ch-1.cpp (limited to 'challenge-080/adam-russell/cpp/ch-1.cpp') 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 +#include +#include +/* +* 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 numbers (n, n + 4); + for(int i = n[0]; i < n[3]; i++){ + std::vector::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 -- cgit