2017年12月_stary_yan

12月 11月 10月 09月 08月 07月 06月 01月

原创 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 size k as well as an independent set of size k, provide

2017-12-31 22:18:20 359

[Leetcode] Union FindThis week, I will solve two problems in the section union find. As we all known, union find is a kind of useful algorithm to find the circle in a directed graph, so it is necessary

2017-12-23 19:07:24 367

原创 [Leetcode] Binary Index Tree

[Leetcode] Binary Index TreeIn this article we will discuss the Binary Indexed Trees structure. According to Peter M. Fenwick, this structure was first used for data compression. Now it is often used f

2017-12-14 12:49:20 518

原创 [Leetcode]Graph & Union Find

Graph & Union FindThis time, I will talk about how to use union find to evaluate if there is a cycle in the graph. Union find is a useful method to evaluate the existence of cycle in a undirected graph

2017-12-07 11:05:15 322

原创 [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 be matched by the pattern. At first, I think it wil

2017-12-02 12:44:34 337

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

stary_yan的博客

原创 NP-Complete Question

原创 [Leetcode] Union Find

原创 [Leetcode] Binary Index Tree

原创 [Leetcode]Graph & Union Find

原创 [Leetcode]Dynamic Programming

空空如也

空空如也