homework 2

task_02/src/list_stack.cpp

@@ -0,0 +1 @@
+#include "list_stacks.hpp"

task_02/src/list_stacks.hpp

@@ -0,0 +1,65 @@
+#pragma once
+
+#include <list>
+#include <stdexcept>
+
+template <typename T>
+class Stack final {
+ public:
+  constexpr Stack() noexcept {}
+  Stack(const Stack& other) : list(other.list) {}
+  Stack(Stack&& other) : list(other.list) { other.list.clear(); }
+  Stack(const std::initializer_list<T>& init_list) : list(init_list) {}
+
+  ~Stack() = default;
+
+  void Push(const T& value) { list.push_back(value); }
+  void Pop() {
+    if (Empty()) throw std::underflow_error("Stack is empty!");
+    list.pop_back();
+  }
+
+  T& Top() {
+    if (Empty()) throw std::underflow_error("Stack is empty!");
+    return list.back();
+  }
+  bool Empty() { return list.empty(); }
+  std::size_t Size() { return list.size(); }
+
+ private:
+  std::list<T> list;
+};
+
+template <typename T>
+class StackMin final {
+ public:
+  constexpr StackMin() noexcept {}
+  StackMin(const StackMin& other) : list(other.list) {}
+  StackMin(StackMin&& other) : list(other.list) { other.list.clear(); }
+  StackMin(const std::initializer_list<T>& init_list) : list(init_list) {}
+
+  ~StackMin() = default;
+
+  void Push(const T& value) {
+    if (min_stack.Empty() || min_stack.Top() > value) min_stack.Push(value);
+    list.push_back(value);
+  }
+  void Pop() {
+    if (Empty()) throw std::underflow_error("Stack is empty!");
+    if (min_stack.Top() == list.back()) min_stack.Pop();
+    list.pop_back();
+  }
+
+  T& Top() {
+    if (Empty()) throw std::underflow_error("Stack is empty!");
+    return list.back();
+  }
+  bool Empty() { return list.empty(); }
+  std::size_t Size() { return list.size(); }
+
+  T& Min() { return min_stack.Top(); }
+
+ private:
+  std::list<T> list;
+  Stack<T> min_stack;
+};

task_02/src/test.cpp

@@ -2,41 +2,62 @@
 #include <gtest/gtest.h>
 
 #include <stack>
+#include <stdexcept>
 
-#include "stack.hpp"
+#include "list_stacks.hpp"
 
-TEST(StackTest, Simple) {
-  Stack stack;
-  stack.Push(1);              // Stack [1]
-  ASSERT_EQ(stack.Pop(), 1);  // Stack []
-  stack.Push(1);              // Stack [1]
-  stack.Push(2);              // Stack [1, 2]
-  ASSERT_EQ(stack.Pop(), 2);  // Stack [1]
-  ASSERT_EQ(stack.Pop(), 1);  // Stack []
-  stack.Push(1);              // Stack [1]
-  stack.Push(2);              // Stack [1, 2]
-  ASSERT_EQ(stack.Pop(), 2);  // Stack [1]
-  stack.Push(3);              // Stack [1, 3]
-  ASSERT_EQ(stack.Pop(), 3);  // Stack [1]
-  ASSERT_EQ(stack.Pop(), 1);  // Stack []
+TEST(StackTest, test1) {
+  Stack<int> stack;
+  stack.Push(1);
+  stack.Pop();
+  EXPECT_THROW(stack.Pop(), std::underflow_error);
+  stack.Push(1);
+  stack.Push(2);
+  ASSERT_EQ(stack.Top(), 2);
+  ASSERT_EQ(stack.Top(), 2);
+  stack.Push(1000);
+  stack.Push(21412);
+  stack.Pop();
+  stack.Pop();
+  stack.Pop();
+  stack.Pop();
+  EXPECT_THROW(stack.Pop(), std::underflow_error);
+  EXPECT_THROW(stack.Top(), std::underflow_error);
+  stack.Push(1);
+  stack.Push(3);
+  ASSERT_EQ(stack.Top(), 3);
+  stack.Pop();
+  ASSERT_EQ(stack.Top(), 1);
 }
 
-TEST(MinStackTest, Simple) {
-  MinStack stack;
-  stack.Push(1);  // Stack [1]
-  ASSERT_EQ(stack.GetMin(), 1);
-  ASSERT_EQ(stack.Pop(), 1);  // Stack []
-  stack.Push(1);              // Stack [1]
-  stack.Push(2);              // Stack [1, 2]
-  ASSERT_EQ(stack.GetMin(), 1);
-  ASSERT_EQ(stack.Pop(), 2);  // Stack [1]
-  ASSERT_EQ(stack.Pop(), 1);  // Stack []
-  stack.Push(1);              // Stack [1]
-  stack.Push(2);              // Stack [1, 2]
-  ASSERT_EQ(stack.GetMin(), 1);
-  ASSERT_EQ(stack.Pop(), 2);  // Stack [1]
-  stack.Push(3);              // Stack [1, 3]
-  ASSERT_EQ(stack.GetMin(), 1);
-  ASSERT_EQ(stack.Pop(), 3);  // Stack [1]
-  ASSERT_EQ(stack.Pop(), 1);  // Stack []
+TEST(MinStackTest, test2) {
+  StackMin<int> stack;
+  stack.Push(1);
+  stack.Pop();
+  EXPECT_THROW(stack.Pop(), std::underflow_error);
+  stack.Push(1);
+  stack.Push(2);
+  ASSERT_EQ(stack.Top(), 2);
+  ASSERT_EQ(stack.Top(), 2);
+  stack.Push(1000);
+  stack.Push(21412);
+  ASSERT_EQ(stack.Min(), 1);
+  stack.Pop();
+  stack.Pop();
+  stack.Pop();
+  stack.Pop();
+  EXPECT_THROW(stack.Min(), std::underflow_error);
+  EXPECT_THROW(stack.Pop(), std::underflow_error);
+  EXPECT_THROW(stack.Top(), std::underflow_error);
+  stack.Push(1);
+  stack.Push(3);
+  ASSERT_EQ(stack.Top(), 3);
+  stack.Pop();
+  ASSERT_EQ(stack.Top(), 1);
+  stack.Push(-10);
+  stack.Push(-102410);
+  stack.Push(10432140);
+  stack.Push(0);
+  stack.Push(-1010);
+  ASSERT_EQ(stack.Min(), -102410);
 }

task_03/src/temperature.cpp

@@ -0,0 +1,14 @@
+#include "temperature.hpp"
+
+std::vector<int> TemperatureCounter(std::vector<double> temps) {
+  std::stack<Day> days;
+  std::vector<int> result(temps.size(), 0);
+  for (int i = 0; i < temps.size(); i++) {
+    while (!days.empty() && days.top().value < temps[i]) {
+      result[days.top().index] = i - days.top().index;
+      days.pop();
+    }
+    days.push(Day(i, temps[i]));
+  }
+  return result;
+}

task_03/src/temperature.hpp

@@ -0,0 +1,11 @@
+#pragma once
+#include <stack>
+#include <vector>
+
+struct Day {
+  int index;
+  double value;
+  Day(int index, double value) : index(index), value(value) {}
+};
+
+std::vector<int> TemperatureCounter(std::vector<double> temps);

task_03/src/test.cpp

@@ -1,8 +1,16 @@
 
 #include <gtest/gtest.h>
 
-#include "topology_sort.hpp"
+#include "temperature.hpp"
 
-TEST(TopologySort, Simple) {
-  ASSERT_EQ(1, 1);  // Stack []
-}
+TEST(TemperatureCnt, Simple) {
+  ASSERT_EQ(TemperatureCounter(std::vector<double>{5.8, 7.2, 4.1, 5.999}),
+            (std::vector<int>{1, 0, 1, 0}));
+  ASSERT_EQ(
+      TemperatureCounter(std::vector<double>{5.99, 12, 4, 9.1, 5.15, 4, 2}),
+      (std::vector<int>{1, 0, 1, 0, 0, 0, 0}));
+  ASSERT_EQ(
+      TemperatureCounter(std::vector<double>{2, 6, 17.512512, 7, 3, 4.412151}),
+      (std::vector<int>{1, 1, 0, 0, 1, 0}));
+  ASSERT_EQ(TemperatureCounter(std::vector<double>{}), std::vector<int>{});
+}