fix test

Author: djeada

src/3_Stack_Queue/.min_in_stack.cpp.swp

@@ -50,43 +50,6 @@
 #include <string>
 #include <vector>
 
-namespace {
-struct TestRunner {
-  int total = 0;
-  int failed = 0;
-
-  void expectEqual(const std::vector<int> &got,
-                   const std::vector<int> &expected, const std::string &label) {
-    ++total;
-    if (got == expected) {
-      std::cout << "[PASS] " << label << "\n";
-      return;
-    }
-    ++failed;
-    std::cout << "[FAIL] " << label << " expected=" << toString(expected)
-              << " got=" << toString(got) << "\n";
-  }
-
-  void summary() const {
-    std::cout << "Tests: " << total - failed << " passed, " << failed
-              << " failed, " << total << " total\n";
-  }
-
-private:
-  static std::string toString(const std::vector<int> &values) {
-    std::ostringstream oss;
-    oss << "{";
-    for (size_t i = 0; i < values.size(); ++i) {
-      if (i > 0)
-        oss << ", ";
-      oss << values[i];
-    }
-    oss << "}";
-    return oss.str();
-  }
-};
-} // namespace
-
 // Simple (Brute-force) Solution
 // Uses a vector to simulate the queue; on deQueue, it shifts elements.
 // Complexity: O(n) per deQueue operation due to element shifting.
@@ -174,6 +137,43 @@ alternativeSolution(int capacity, const std::vector<std::string> &operations) {
   return std::vector<int>(dq.begin(), dq.end());
 }
 
+namespace {
+struct TestRunner {
+  int total = 0;
+  int failed = 0;
+
+  void expectEqual(const std::vector<int> &got,
+                   const std::vector<int> &expected, const std::string &label) {
+    ++total;
+    if (got == expected) {
+      std::cout << "[PASS] " << label << "\n";
+      return;
+    }
+    ++failed;
+    std::cout << "[FAIL] " << label << " expected=" << toString(expected)
+              << " got=" << toString(got) << "\n";
+  }
+
+  void summary() const {
+    std::cout << "Tests: " << total - failed << " passed, " << failed
+              << " failed, " << total << " total\n";
+  }
+
+private:
+  static std::string toString(const std::vector<int> &values) {
+    std::ostringstream oss;
+    oss << "{";
+    for (size_t i = 0; i < values.size(); ++i) {
+      if (i > 0)
+        oss << ", ";
+      oss << values[i];
+    }
+    oss << "}";
+    return oss.str();
+  }
+};
+} // namespace
+
 // Test cases for correctness
 void test() {
   int capacity = 3;

src/3_Stack_Queue/circular_queue.cpp

@@ -39,8 +39,10 @@
 // 1) Full Sort
 // Time:  O(n log n)
 // Space: O(n)
-std::vector<int> findSmallestKNumbersSort(const std::vector<int>& input, int k) {
-  if (k <= 0) return {};
+std::vector<int> findSmallestKNumbersSort(const std::vector<int> &input,
+                                          int k) {
+  if (k <= 0)
+    return {};
 
   std::vector<int> result = input;
   std::sort(result.begin(), result.end());
@@ -54,8 +56,10 @@ std::vector<int> findSmallestKNumbersSort(const std::vector<int>& input, int k)
 // 2) Max Heap (size k)
 // Time:  O(n log k)
 // Space: O(k)
-std::vector<int> findSmallestKNumbersHeap(const std::vector<int>& input, int k) {
-  if (k <= 0) return {};
+std::vector<int> findSmallestKNumbersHeap(const std::vector<int> &input,
+                                          int k) {
+  if (k <= 0)
+    return {};
   if (k >= static_cast<int>(input.size())) {
     std::vector<int> result = input;
     std::sort(result.begin(), result.end());
@@ -84,9 +88,10 @@ std::vector<int> findSmallestKNumbersHeap(const std::vector<int>& input, int k)
 // 3) nth_element
 // Avg Time: O(n), Worst: O(n^2)
 // Space:    O(n)
-std::vector<int> findSmallestKNumbersNthElement(const std::vector<int>& input,
+std::vector<int> findSmallestKNumbersNthElement(const std::vector<int> &input,
                                                 int k) {
-  if (k <= 0) return {};
+  if (k <= 0)
+    return {};
   if (k >= static_cast<int>(input.size())) {
     std::vector<int> result = input;
     std::sort(result.begin(), result.end());

src/3_Stack_Queue/k_least_numbers.cpp

@@ -38,29 +38,6 @@
 #include <string>
 #include <vector>
 
-namespace {
-struct TestRunner {
-  int total = 0;
-  int failed = 0;
-
-  void expectEqual(int got, int expected, const std::string &label) {
-    ++total;
-    if (got == expected) {
-      std::cout << "[PASS] " << label << "\n";
-      return;
-    }
-    ++failed;
-    std::cout << "[FAIL] " << label << " expected=" << expected
-              << " got=" << got << "\n";
-  }
-
-  void summary() const {
-    std::cout << "Tests: " << total - failed << " passed, " << failed
-              << " failed, " << total << " total\n";
-  }
-};
-} // namespace
-
 // Simple (Brute-force) Solution
 // Uses a deque for queue operations and scans the entire queue on each max()
 // call. Complexity: O(n) for max() operation.
@@ -159,6 +136,29 @@ class AlternativeMaxQueue {
   std::multiset<int> mset;
 };
 
+namespace {
+struct TestRunner {
+  int total = 0;
+  int failed = 0;
+
+  void expectEqual(int got, int expected, const std::string &label) {
+    ++total;
+    if (got == expected) {
+      std::cout << "[PASS] " << label << "\n";
+      return;
+    }
+    ++failed;
+    std::cout << "[FAIL] " << label << " expected=" << expected
+              << " got=" << got << "\n";
+  }
+
+  void summary() const {
+    std::cout << "Tests: " << total - failed << " passed, " << failed
+              << " failed, " << total << " total\n";
+  }
+};
+} // namespace
+
 // Test cases for correctness
 void test() {
   // Simulate a series of operations: