VegetableCoder

```class Solution { public: int numRescueBoats(vector& people, int limit) { sort(people.begin(), peo

```class Solution { public: int eraseOverlapIntervals(vector>& q) { sort(q.begin(), q.end(), [](vect

455. 分发饼干 排序的时间复杂度为 O(nlogn)，遍历的过程为 O(n)，故总时间复杂度为 O(nlogn)。

LeetCode 322. 零钱兑换 + 518. 零钱兑换 II动态规划 01背包、完全背包问题。

如果使用一维dp数组，物品遍历的for循环放在外层，遍历背包的for循环放在内层，且内层for循环倒序遍历！

```C++ class Solution { public: int longestCommonSubsequence(string text1, string text2) { int n = t

```C++ class Solution { public: int rob(vector& nums) { int n = nums.size(); vector f(n + 1), g(n +

```C++ class Solution { public: int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1}; int maxDistance(ve

```C++ class Solution { public: int n, m; vector> g; int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1