stary_yan的博客

数据爱好者。

NP-Complete Question

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 siz...

2017-12-31 22:18:20

阅读数:82

评论数:0

[Leetcode]Dynamic Programming

[Leetcode]Dynamic ProgrammingRegular Expression MatchingAnalysisIt is easy to understand the problem. What we need to do is to find if the string can...

2017-12-02 12:44:34

阅读数:61

评论数:0

[算法]二叉堆

#include <iostream> using namespace std; #define MAXSIZE 100class BinaryHeap { private: int values[MAXSIZE]; int size{0}; bool cmp(i...

2017-01-09 20:44:10

阅读数:264

评论数:0

[算法]AVL树

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

2017-01-09 19:56:24

阅读数:248

评论数:0

[算法]详解关键路径算法

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

2017-01-09 10:20:22

阅读数:1125

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭