UnkownCC

终于完结撒花了，其中印象最深刻的还是二叉树部分和动态规划部分，接下来计划刷剑指offer，加油加油终于完结撒花了，其中印象最深刻的还是二叉树部分和动态规划部分，接下来计划刷剑指offer，加油加油

--- highlight: monokai --- ```c++ class Solution { public: int largestRectangleArea(vector& heights)

--- highlight: monokai --- ``` c++ class Solution { public: int countSubstrings(string s) { vector>

--- highlight: monokai --- ```c++ class Solution { public: vector nextGreaterElements(vector& nums)

// 版本一 class Solution { public: vector nextGreaterElement(vector& nums1, vector& nums2) { stack st;

--- highlight: monokai --- ```c++ class Solution { public: int countSubstrings(string s) { vector> d

--- highlight: monokai --- ```c++ class Solution { public: // 动态规划五部曲：dp定义、初始化、递推公式、递归顺序、推导 int minD

思路：这道题是真的打脑壳，以至于炸出了思路模块，提示：这题可以理解为从s中删去元素能否得到t！！！！

--- highlight: monokai --- ```c++ class Solution { public: int longestCommonSubsequence(string text1