h_index

Author: bibincnair

include/leeter/h_index.hpp

@@ -0,0 +1,20 @@
+#include <vector>
+#include <algorithm>
+using std::vector;
+using std::sort;
+
+namespace h_index {
+  class Solution {
+  public:
+    int hIndex(vector<int>& citations) {
+        sort(citations.begin(), citations.end());
+        int n = citations.size();
+        for (int i = 0; i < n; ++i) {
+            if (citations[i] >= n - i) {
+            return n - i;
+            }
+        }
+        return 0;
+    }
+  };
+}  // namespace h_index

test/source/test_h_index.cpp

@@ -0,0 +1,17 @@
+#include <doctest/doctest.h>
+#include "leeter/h_index.hpp"
+
+
+TEST_CASE("h index: test case 1") {
+  vector<int> input = {3, 0, 6, 1, 5};
+  h_index::Solution sol;
+  int output = sol.hIndex(input);
+  CHECK(output == 3);
+}
+
+TEST_CASE("h index: test case 2") {
+  vector<int> input = {1, 3, 1};
+  h_index::Solution sol;
+  int output = sol.hIndex(input);
+  CHECK(output == 1);
+}