hclbeloved的博客

1 题目150. 逆波兰表达式求值剑指 Offer II 036. 后缀表达式2 实现class Solution {public: int evalRPN(vector<string>& tokens) { stack<long> s; for (auto& str:tokens) { if (str.find_first_of("+-*\/") == string:

class Solution {public: vector<int> asteroidCollision(vector<int>& asteroids) { stack<int> s; s.push(INT_MIN); for (auto n : asteroids) { if (n < 0) { .

1 题目力扣2 解答class Solution {public: int largestRectangleArea(vector<int>& heights) { //从小到大的动态规划，经过分析不太好做。。。。 //从大到小的动态规划，貌似也不太好做。。。。。 //单调递增栈，参考链接：https://leetcode-cn.com/problems/0ynMMM/solution/jian-zhi-offer-