Stack implementation which returns MIN() value in O(1) time (LeetCode OJ)

MinStack.cpp

#include <stack>
 
class MinStack {
 public:
    void push(int x) {
        s.push(x);
 
        if (m.empty() == true || m.top() >= x) {
            m.push(x);
        }
    }
 
    void pop() {
        if (m.top() == s.top()) {
            m.pop();
        }
        s.pop();
    }
 
 
    int top() {
        return s.top();
    }
 
    int getMin() {
        return m.top();
    }
    
 private:
    std::stack<int> s;
    std::stack<int> m;
};