initial commit

rotate/meson.build

@@ -0,0 +1 @@
+executable('rotate', 'src/main.cpp', install: true)

rotate/src/main.cpp

@@ -0,0 +1,38 @@
+// #include "twopointers.hpp"
+// #include "rmdupsfromsortedarray.hpp"
+// #include "rmdufromsortedarray2.hpp"
+#include <cassert>
+#include <iostream>
+// #include "majorityelement.hpp"
+#include "rotate.hpp"
+
+int main() {
+  // std::vector<int> nums = {3,2,2,3};
+  // int val = 3;
+  // int k = removeElement(nums, val);
+  // for (int i = 0; i < k; i++) {
+  //     std::cout << "num: " << nums[i] << std::endl;
+  // }
+  // std::cout << "k: " << k << std::endl;
+
+  // std::vector<int> nums1 = {1,1,2};
+  // int k1 = removeDuplicates(nums1);
+  // for (int i = 0; i < k1; i++) {
+  //     std::cout << "num1: " << nums1[i] << std::endl;
+  // }
+  // std::cout << "k1: " << k1 << std::endl;
+  // std::vector<int> nums = {1, 1, 1, 2, 2, 3};
+  // std::vector<int> expectednums = {1, 1, 2, 2, 3};
+  // int k = removeDuplicates(nums);
+  // assert(k == expectednums.size());
+  // for (int i = 0; i < k; i++)
+  // {
+  //     assert(nums[i] == expectednums[i]);
+  // }
+  std::vector<int> nums = {1, 2, 3, 4, 5, 6, 7};
+  rotateArray(nums, 3);
+  for (int i = 0; i < int(nums.size()); i++) {
+    std::cout << "num: " << nums[i] << std::endl;
+  }
+  return 0;
+}

rotate/src/rotate.hpp

@@ -0,0 +1,13 @@
+#include <algorithm>
+#include <iostream>
+#include <vector>
+
+inline void rotateArray(std::vector<int> &nums, int k) {
+  int n = nums.size();
+  if (n == 0) return;
+  k %= n;
+
+  std::reverse(nums.begin(), nums.end());
+  std::reverse(nums.begin(), nums.begin() + k);
+  std::reverse(nums.begin() + k, nums.end());
+}