From dc6e6dc4252027b60ebd935abb1a53ce46145989 Mon Sep 17 00:00:00 2001
From: deadmarshal <adeadmarshal@gmail.com>
Date: Wed, 4 Jan 2023 09:44:53 +0330
Subject: TWC198

---
 challenge-198/deadmarshal/cpp/ch-1.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 challenge-198/deadmarshal/cpp/ch-1.cpp

(limited to 'challenge-198/deadmarshal/cpp/ch-1.cpp')

diff --git a/challenge-198/deadmarshal/cpp/ch-1.cpp b/challenge-198/deadmarshal/cpp/ch-1.cpp
new file mode 100644
index 0000000000..2065745b5f
--- /dev/null
+++ b/challenge-198/deadmarshal/cpp/ch-1.cpp
@@ -0,0 +1,30 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+
+template<typename T>
+int max_gap(std::vector<T> &vec)
+{
+  if(vec.size() < 2) return 0;
+  std::sort(vec.begin(),vec.end());
+  size_t i{};
+  int max{},count{},temp{};
+  while(i < vec.size())
+  {
+    temp = abs(vec[i] - vec[i+1]);
+    if(temp > max) max = temp;
+    i += 2;
+  }
+  for(i = 0; i < vec.size()-1; ++i)
+    if(abs(vec[i] - vec[i+1]) == max) count++;
+  return count;
+}
+
+int main()
+{
+  std::vector<int> vec1{2,5,8,1},vec2{3};
+  std::cout << max_gap<int>(vec1) << '\n';
+  std::cout << max_gap<int>(vec2) << '\n';
+  return 0;
+}
+
-- 
cgit