s0026

include/s0026_remove_duplicates_from_sorted_array.hpp

@@ -0,0 +1,13 @@
+#ifndef S0026_REMOVE_DUPLICATES_FROM_SORTED_ARRAY
+#define S0026_REMOVE_DUPLICATES_FROM_SORTED_ARRAY
+
+#include <vector>
+
+using namespace std;
+
+class Solution {
+ public:
+  int removeDuplicates(vector<int>& nums);
+};
+
+#endif

src/s0026_remove_duplicates_from_sorted_array.cpp

@@ -0,0 +1,17 @@
+#include "s0026_remove_duplicates_from_sorted_array.hpp"
+
+int Solution::removeDuplicates(vector<int>& nums) {
+  int size = nums.size();
+  if (size == 0 || size == 1) {
+    return size;
+  }
+  int slow{0};
+  for (int fast{1}; fast < size; ++fast) {
+    if (nums.at(fast) == nums.at(slow)) {
+      continue;
+    } else {
+      nums[++slow] = nums.at(fast);
+    }
+  }
+  return slow + 1;
+}

tests/s0026_remove_duplicates_from_sorted_array.cpp

@@ -0,0 +1,17 @@
+#include "s0026_remove_duplicates_from_sorted_array.hpp"
+
+#include <gtest/gtest.h>
+
+TEST(Problem26, Case1) {
+  vector<int> i{1, 1, 2};
+  int o{2};
+  Solution solution;
+  EXPECT_EQ(solution.removeDuplicates(i), o);
+}
+
+TEST(Problem26, Case2) {
+  vector<int> i{0, 0, 1, 1, 1, 2, 2, 3, 3, 4};
+  int o{5};
+  Solution solution;
+  EXPECT_EQ(solution.removeDuplicates(i), o);
+}