easonchenys的专栏

这道题主要难点是栈的使用。 #include #include #include #include using namespace std; class Solution { public: bool IsOp(string s) { if (s == "+" || s == "-" || s == "*" || s == "/") return true; els

#include #include #include using namespace std; class Solution { public: string ss; void reverseWords(string &s) { stack s1, s2; int l = s.length(); char *a = new char[l + 1]; int i, sta

class Solution { public: int maxPoints(vector &points) { int size = points.size(); if (points.size() < 2) return points.size(); bool **a = new bool*[size]; for (int i = 0; i < size; i++)

class MinStack { public: void push(int x) { if (mini.empty()) { mini.push(x); mystack.push(x); return; } if (mini.top()>=x) { mini.push(x); } mystack.push(x); ret