From d8f3b40085619cb680c8f227c65a1f5acc393223 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: Move leetcode solutions to subdir.

---
 cpp/155-2.cpp | 48 ------------------------------------------------
 1 file changed, 48 deletions(-)
 delete mode 100644 cpp/155-2.cpp

(limited to 'cpp/155-2.cpp')

diff --git a/cpp/155-2.cpp b/cpp/155-2.cpp
deleted file mode 100644
index aa07eee..0000000
--- a/cpp/155-2.cpp
+++ /dev/null
@@ -1,48 +0,0 @@
-#include <vector>
-#include <algorithm>
-
-class MinStack
-{
-public:
-    /** initialize your data structure here. */
-    MinStack()
-    {
-        // Although I really think this is just a trick for this problem.
-        // Leetcode does not give the input size. So I just make a reasonable assumption.
-        data_.reserve(10000);
-        min_stack_.reserve(10000);
-    }
-
-    void push(int x)
-    {
-        data_.push_back(x);
-        if (min_stack_.empty())
-        {
-            min_stack_.push_back(x);
-        }
-        else
-        {
-            min_stack_.push_back(std::min(min_stack_.back(), x));
-        }
-    }
-
-    void pop()
-    {
-        data_.pop_back();
-        min_stack_.pop_back();
-    }
-
-    int top()
-    {
-        return data_.back();
-    }
-
-    int getMin()
-    {
-        return min_stack_.back();
-    }
-
-private:
-    std::vector<int> data_;
-    std::vector<int> min_stack_;
-};
-- 
cgit v1.2.3