stary_yan的博客

详解关键路径算法#include <iostream>#include <vector>using namespace std;int eventsSize, activitiesSize;int activitiesCostTimes[100][100];pair<int, int> activities[100];int eventEarlyBegin[100], eventLate

#include <iostream>using namespace std;struct TreeNode { int key; int height{0}; TreeNode* left, * right; TreeNode(int tKey = 0, TreeNode* tLeft = nullptr, TreeNode* tRigh

#include <iostream>using namespace std;#define MAXSIZE 100class BinaryHeap {private: int values[MAXSIZE]; int size{0}; bool cmp(int left, int right) { return left < right; }

[Leetcode]Dynamic ProgrammingRegular Expression MatchingAnalysisIt is easy to understand the problem. What we need to do is to find if the string can be matched by the pattern. At first, I think it wil

NP-Complete Question Prove that the following problem is NP-complete: given an undirected graph G = (V, E) and an integer k, return a clique of size k as well as an independent set of size k, provide