linghugoolge的博客

207. 课程表 class Solution { public: bool canFinish(int nums, vector<vector<int>>& pres) { if (pres.size() == 0 || pres[0].size() == 0) { return true; } vector<vector<int>> paths(nums);

1、单字符串/数组 模板 一般dp[i]表示以i结尾的子序列，，最终结果为dp[n-1]。 53. 最大子序和 class Solution { public: int maxSubArray(vector<int>& nums) { int n = nums.size(); vector<int> dp(n, 0); for (int i=0; i<n; i++) { dp[

1、01背包：只能用一次 1.1、是否存在 416. Partition Equal Subset Sum class Solution { public: bool canPartition(vector<int>& nums) { int n=nums.size(); int sum=0; for (int i=0;i<n;i++) { sum+=nums[i]; }

merge sort reference:https://blog.csdn.net/zpznba/article/details/83745205 It's post-order traversal. #include <iostream> #include <vector> using namespace std; void mergeHelper(vector<int> &nums, int left, int mid, int ..